./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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/kundu1.cil.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 296e273b1c19d017b7d3722a7c74d29ba546c812 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-dev-20ed64e [2021-08-27 16:30:01,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:30:01,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:30:01,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:30:01,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:30:01,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:30:01,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:30:01,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:30:01,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:30:01,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:30:01,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:30:01,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:30:01,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:30:01,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:30:01,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:30:01,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:30:01,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:30:01,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:30:01,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:30:01,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:30:01,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:30:01,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:30:01,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:30:01,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:30:01,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:30:01,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:30:01,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:30:01,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:30:01,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:30:01,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:30:01,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:30:01,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:30:01,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:30:01,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:30:01,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:30:01,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:30:01,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:30:01,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:30:01,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:30:01,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:30:01,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:30:01,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:30:01,227 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:30:01,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:30:01,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:30:01,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:30:01,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:30:01,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:30:01,229 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:30:01,229 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:30:01,229 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:30:01,229 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:30:01,229 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:30:01,230 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:30:01,230 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:30:01,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:30:01,230 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:30:01,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:30:01,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:30:01,231 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:30:01,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:30:01,232 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:30:01,232 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:30:01,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:30:01,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:30:01,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:30:01,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:30:01,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:30:01,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:30:01,234 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:30:01,234 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 -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2021-08-27 16:30:01,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:30:01,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:30:01,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:30:01,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:30:01,540 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:30:01,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2021-08-27 16:30:01,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fe4f01d/91c8691ffce14eadbff10aec637c0239/FLAG7d24aa0ff [2021-08-27 16:30:02,019 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:30:02,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2021-08-27 16:30:02,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fe4f01d/91c8691ffce14eadbff10aec637c0239/FLAG7d24aa0ff [2021-08-27 16:30:02,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fe4f01d/91c8691ffce14eadbff10aec637c0239 [2021-08-27 16:30:02,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:30:02,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:30:02,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:02,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:30:02,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:30:02,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02, skipping insertion in model container [2021-08-27 16:30:02,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:30:02,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:30:02,569 WARN L228 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/kundu1.cil.c[331,344] [2021-08-27 16:30:02,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:02,651 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:30:02,684 WARN L228 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/kundu1.cil.c[331,344] [2021-08-27 16:30:02,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:30:02,709 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:30:02,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02 WrapperNode [2021-08-27 16:30:02,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:30:02,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:02,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:30:02,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:30:02,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:30:02,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:30:02,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:30:02,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:30:02,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:30:02,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:30:02,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:30:02,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:30:02,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (1/1) ... [2021-08-27 16:30:02,796 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:30:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:30:02,825 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-08-27 16:30:02,838 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-08-27 16:30:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:30:02,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:30:02,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:30:02,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:30:03,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:30:03,246 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2021-08-27 16:30:03,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03 BoogieIcfgContainer [2021-08-27 16:30:03,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:30:03,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:30:03,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:30:03,250 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:30:03,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,251 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:30:02" (1/3) ... [2021-08-27 16:30:03,251 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742aa5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:03, skipping insertion in model container [2021-08-27 16:30:03,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:30:02" (2/3) ... [2021-08-27 16:30:03,252 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@742aa5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:30:03, skipping insertion in model container [2021-08-27 16:30:03,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:30:03,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03" (3/3) ... [2021-08-27 16:30:03,253 INFO L389 chiAutomizerObserver]: Analyzing ICFG kundu1.cil.c [2021-08-27 16:30:03,302 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:30:03,302 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:30:03,302 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:30:03,302 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:30:03,302 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:30:03,302 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:30:03,302 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:30:03,303 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:30:03,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 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-08-27 16:30:03,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-27 16:30:03,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,350 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,350 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,350 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:30:03,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 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-08-27 16:30:03,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2021-08-27 16:30:03,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,365 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,366 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,372 INFO L791 eck$LassoCheckResult]: Stem: 106#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 33#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 56#L488true havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 76#L221true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 48#L228-1true assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 54#L233-1true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 101#L109true assume 1 == ~P_1_pc~0; 59#L110true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 40#L120true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 24#L121true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 13#L375true assume !(0 != activate_threads_~tmp~1); 34#L375-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 72#L191true assume 1 == ~C_1_pc~0; 88#L192true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 67#L212true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 112#L213true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 45#L383true assume !(0 != activate_threads_~tmp___1~1); 28#L437-1true [2021-08-27 16:30:03,375 INFO L793 eck$LassoCheckResult]: Loop: 28#L437-1true assume !false; 84#L438true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 47#L296true assume false; 114#L312true start_simulation_~kernel_st~0 := 2; 51#L221-1true start_simulation_~kernel_st~0 := 3; 7#L323true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4#L109-3true assume 1 == ~P_1_pc~0; 19#L110-1true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 41#L120-1true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 96#L121-1true activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 107#L375-3true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 37#L375-5true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 22#L191-3true assume 1 == ~C_1_pc~0; 115#L192-1true assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 92#L212-1true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 105#L213-1true activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 30#L383-3true assume !(0 != activate_threads_~tmp___1~1); 14#L383-5true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 20#L246-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 52#L259-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 73#L260-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 99#L456true assume !(0 == start_simulation_~tmp~3); 85#L456-1true 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; 16#L246-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 103#L259-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 86#L260-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 49#L411true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17#L418true stop_simulation_#res := stop_simulation_~__retres2~0; 8#L419true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 12#L469true assume !(0 != start_simulation_~tmp___0~2); 28#L437-1true [2021-08-27 16:30:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1468371184, now seen corresponding path program 1 times [2021-08-27 16:30:03,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550973056] [2021-08-27 16:30:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550973056] [2021-08-27 16:30:03,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550973056] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425737705] [2021-08-27 16:30:03,562 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,565 INFO L82 PathProgramCache]: Analyzing trace with hash 101330720, now seen corresponding path program 1 times [2021-08-27 16:30:03,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632589236] [2021-08-27 16:30:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632589236] [2021-08-27 16:30:03,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632589236] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:03,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133333276] [2021-08-27 16:30:03,597 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,610 INFO L87 Difference]: Start difference. First operand has 114 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 113 states have internal predecessors, (174), 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 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-08-27 16:30:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,635 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-08-27 16:30:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 163 transitions. [2021-08-27 16:30:03,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-08-27 16:30:03,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 156 transitions. [2021-08-27 16:30:03,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2021-08-27 16:30:03,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2021-08-27 16:30:03,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 156 transitions. [2021-08-27 16:30:03,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,651 INFO L681 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-27 16:30:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 156 transitions. [2021-08-27 16:30:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-08-27 16:30:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.471698113207547) internal successors, (156), 105 states have internal predecessors, (156), 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-08-27 16:30:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2021-08-27 16:30:03,689 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-27 16:30:03,689 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 156 transitions. [2021-08-27 16:30:03,689 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:30:03,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 156 transitions. [2021-08-27 16:30:03,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 85 [2021-08-27 16:30:03,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,691 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,691 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,691 INFO L791 eck$LassoCheckResult]: Stem: 341#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 287#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 288#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 316#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 305#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 306#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 314#L109 assume 1 == ~P_1_pc~0; 318#L110 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 297#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 276#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 253#L375 assume !(0 != activate_threads_~tmp~1); 254#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 289#L191 assume 1 == ~C_1_pc~0; 332#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 329#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 330#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 302#L383 assume !(0 != activate_threads_~tmp___1~1); 252#L437-1 [2021-08-27 16:30:03,692 INFO L793 eck$LassoCheckResult]: Loop: 252#L437-1 assume !false; 281#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 259#L296 assume !false; 295#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 296#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 312#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 315#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 241#L276 assume !(0 != eval_~tmp___2~0); 243#L312 start_simulation_~kernel_st~0 := 2; 310#L221-1 start_simulation_~kernel_st~0 := 3; 244#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 236#L109-3 assume !(1 == ~P_1_pc~0); 237#L109-5 is_P_1_triggered_~__retres1~0 := 0; 249#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 298#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 338#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 294#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 273#L191-3 assume 1 == ~C_1_pc~0; 274#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 301#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 337#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 284#L383-3 assume !(0 != activate_threads_~tmp___1~1); 255#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 256#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 267#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 311#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 333#L456 assume !(0 == start_simulation_~tmp~3); 334#L456-1 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; 260#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 261#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 336#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 307#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 263#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 245#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 246#L469 assume !(0 != start_simulation_~tmp___0~2); 252#L437-1 [2021-08-27 16:30:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash -457253934, now seen corresponding path program 1 times [2021-08-27 16:30:03,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251914649] [2021-08-27 16:30:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251914649] [2021-08-27 16:30:03,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251914649] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:03,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99597680] [2021-08-27 16:30:03,748 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 1 times [2021-08-27 16:30:03,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437885360] [2021-08-27 16:30:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437885360] [2021-08-27 16:30:03,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437885360] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686125056] [2021-08-27 16:30:03,791 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:03,793 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. cyclomatic complexity: 51 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-08-27 16:30:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:03,833 INFO L93 Difference]: Finished difference Result 187 states and 270 transitions. [2021-08-27 16:30:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:03,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 270 transitions. [2021-08-27 16:30:03,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 167 [2021-08-27 16:30:03,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 187 states and 270 transitions. [2021-08-27 16:30:03,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2021-08-27 16:30:03,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 [2021-08-27 16:30:03,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 270 transitions. [2021-08-27 16:30:03,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:03,839 INFO L681 BuchiCegarLoop]: Abstraction has 187 states and 270 transitions. [2021-08-27 16:30:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 270 transitions. [2021-08-27 16:30:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2021-08-27 16:30:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.4480874316939891) internal successors, (265), 182 states have internal predecessors, (265), 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-08-27 16:30:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2021-08-27 16:30:03,855 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-08-27 16:30:03,856 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 265 transitions. [2021-08-27 16:30:03,856 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:30:03,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 265 transitions. [2021-08-27 16:30:03,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 163 [2021-08-27 16:30:03,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:03,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:03,858 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,859 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:03,859 INFO L791 eck$LassoCheckResult]: Stem: 653#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 592#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 593#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 623#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 612#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 613#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 621#L109 assume !(1 == ~P_1_pc~0); 650#L109-2 is_P_1_triggered_~__retres1~0 := 0; 602#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 580#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 554#L375 assume !(0 != activate_threads_~tmp~1); 555#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 598#L191 assume 1 == ~C_1_pc~0; 640#L192 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 635#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 636#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 607#L383 assume !(0 != activate_threads_~tmp___1~1); 553#L437-1 [2021-08-27 16:30:03,859 INFO L793 eck$LassoCheckResult]: Loop: 553#L437-1 assume !false; 585#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 560#L296 assume !false; 668#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 666#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 665#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 622#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 542#L276 assume !(0 != eval_~tmp___2~0); 544#L312 start_simulation_~kernel_st~0 := 2; 616#L221-1 start_simulation_~kernel_st~0 := 3; 547#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 538#L109-3 assume !(1 == ~P_1_pc~0); 539#L109-5 is_P_1_triggered_~__retres1~0 := 0; 550#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 603#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 648#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 599#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 577#L191-3 assume 1 == ~C_1_pc~0; 578#L192-1 assume 1 == ~e~0;is_C_1_triggered_~__retres1~1 := 1; 606#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 647#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 588#L383-3 assume !(0 != activate_threads_~tmp___1~1); 589#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 708#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 617#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 618#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 641#L456 assume !(0 == start_simulation_~tmp~3); 643#L456-1 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; 561#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 562#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 645#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 611#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 564#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 545#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 546#L469 assume !(0 != start_simulation_~tmp___0~2); 553#L437-1 [2021-08-27 16:30:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1330092589, now seen corresponding path program 1 times [2021-08-27 16:30:03,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978430638] [2021-08-27 16:30:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978430638] [2021-08-27 16:30:03,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978430638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 16:30:03,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477295221] [2021-08-27 16:30:03,902 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1076710775, now seen corresponding path program 2 times [2021-08-27 16:30:03,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:03,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776828887] [2021-08-27 16:30:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:03,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:03,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:03,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776828887] [2021-08-27 16:30:03,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776828887] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:03,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:03,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:03,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904678769] [2021-08-27 16:30:03,943 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:03,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 16:30:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 16:30:03,944 INFO L87 Difference]: Start difference. First operand 183 states and 265 transitions. cyclomatic complexity: 83 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-08-27 16:30:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,044 INFO L93 Difference]: Finished difference Result 409 states and 574 transitions. [2021-08-27 16:30:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 16:30:04,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 574 transitions. [2021-08-27 16:30:04,051 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 378 [2021-08-27 16:30:04,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 574 transitions. [2021-08-27 16:30:04,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2021-08-27 16:30:04,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2021-08-27 16:30:04,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 574 transitions. [2021-08-27 16:30:04,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,069 INFO L681 BuchiCegarLoop]: Abstraction has 409 states and 574 transitions. [2021-08-27 16:30:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 574 transitions. [2021-08-27 16:30:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 315. [2021-08-27 16:30:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 314 states have internal predecessors, (448), 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-08-27 16:30:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 448 transitions. [2021-08-27 16:30:04,089 INFO L704 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-08-27 16:30:04,090 INFO L587 BuchiCegarLoop]: Abstraction has 315 states and 448 transitions. [2021-08-27 16:30:04,090 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:30:04,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 448 transitions. [2021-08-27 16:30:04,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 296 [2021-08-27 16:30:04,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,092 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,092 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,093 INFO L791 eck$LassoCheckResult]: Stem: 1254#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1194#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 1195#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1224#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1214#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1215#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1222#L109 assume !(1 == ~P_1_pc~0); 1252#L109-2 is_P_1_triggered_~__retres1~0 := 0; 1205#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1183#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1161#L375 assume !(0 != activate_threads_~tmp~1); 1162#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1201#L191 assume !(1 == ~C_1_pc~0); 1230#L191-2 assume !(2 == ~C_1_pc~0); 1231#L201-1 is_C_1_triggered_~__retres1~1 := 0; 1234#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1235#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1210#L383 assume !(0 != activate_threads_~tmp___1~1); 1158#L437-1 [2021-08-27 16:30:04,093 INFO L793 eck$LassoCheckResult]: Loop: 1158#L437-1 assume !false; 1188#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1165#L296 assume !false; 1203#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1204#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1220#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1223#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 1147#L276 assume !(0 != eval_~tmp___2~0); 1149#L312 start_simulation_~kernel_st~0 := 2; 1218#L221-1 start_simulation_~kernel_st~0 := 3; 1152#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1143#L109-3 assume !(1 == ~P_1_pc~0); 1144#L109-5 is_P_1_triggered_~__retres1~0 := 0; 1155#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1206#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1250#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1202#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 1179#L191-3 assume !(1 == ~C_1_pc~0); 1180#L191-5 assume 2 == ~C_1_pc~0; 1238#L202-1 assume 1 == ~C_1_ev~0;is_C_1_triggered_~__retres1~1 := 1; 1209#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 1249#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1191#L383-3 assume !(0 != activate_threads_~tmp___1~1); 1159#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1160#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1175#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1219#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1239#L456 assume !(0 == start_simulation_~tmp~3); 1241#L456-1 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; 1166#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 1167#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1245#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1213#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1169#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 1150#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1151#L469 assume !(0 != start_simulation_~tmp___0~2); 1158#L437-1 [2021-08-27 16:30:04,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 1 times [2021-08-27 16:30:04,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36337070] [2021-08-27 16:30:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,104 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,149 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2030427419, now seen corresponding path program 1 times [2021-08-27 16:30:04,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199580299] [2021-08-27 16:30:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199580299] [2021-08-27 16:30:04,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199580299] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819103336] [2021-08-27 16:30:04,187 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:30:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:30:04,192 INFO L87 Difference]: Start difference. First operand 315 states and 448 transitions. cyclomatic complexity: 134 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-08-27 16:30:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,278 INFO L93 Difference]: Finished difference Result 549 states and 768 transitions. [2021-08-27 16:30:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 16:30:04,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 768 transitions. [2021-08-27 16:30:04,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 530 [2021-08-27 16:30:04,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 768 transitions. [2021-08-27 16:30:04,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 549 [2021-08-27 16:30:04,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 549 [2021-08-27 16:30:04,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 768 transitions. [2021-08-27 16:30:04,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,286 INFO L681 BuchiCegarLoop]: Abstraction has 549 states and 768 transitions. [2021-08-27 16:30:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 768 transitions. [2021-08-27 16:30:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 327. [2021-08-27 16:30:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 327 states have (on average 1.4067278287461773) internal successors, (460), 326 states have internal predecessors, (460), 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-08-27 16:30:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2021-08-27 16:30:04,305 INFO L704 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-08-27 16:30:04,305 INFO L587 BuchiCegarLoop]: Abstraction has 327 states and 460 transitions. [2021-08-27 16:30:04,306 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:30:04,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 460 transitions. [2021-08-27 16:30:04,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2021-08-27 16:30:04,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,309 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,309 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,309 INFO L791 eck$LassoCheckResult]: Stem: 2157#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2077#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 2078#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2111#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2098#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2099#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2109#L109 assume !(1 == ~P_1_pc~0); 2151#L109-2 is_P_1_triggered_~__retres1~0 := 0; 2088#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2063#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2038#L375 assume !(0 != activate_threads_~tmp~1); 2039#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2079#L191 assume !(1 == ~C_1_pc~0); 2120#L191-2 assume !(2 == ~C_1_pc~0); 2121#L201-1 is_C_1_triggered_~__retres1~1 := 0; 2124#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2125#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2093#L383 assume !(0 != activate_threads_~tmp___1~1); 2094#L437-1 [2021-08-27 16:30:04,309 INFO L793 eck$LassoCheckResult]: Loop: 2094#L437-1 assume !false; 2265#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2213#L296 assume !false; 2211#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2210#L246 assume !(0 == ~P_1_st~0); 2207#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2205#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2202#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 2200#L276 assume !(0 != eval_~tmp___2~0); 2199#L312 start_simulation_~kernel_st~0 := 2; 2198#L221-1 start_simulation_~kernel_st~0 := 3; 2029#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2023#L109-3 assume !(1 == ~P_1_pc~0); 2024#L109-5 is_P_1_triggered_~__retres1~0 := 0; 2034#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2089#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2147#L375-3 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2085#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 2061#L191-3 assume !(1 == ~C_1_pc~0); 2062#L191-5 assume !(2 == ~C_1_pc~0); 2128#L201-3 is_C_1_triggered_~__retres1~1 := 0; 2307#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 2306#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2305#L383-3 assume !(0 != activate_threads_~tmp___1~1); 2304#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2302#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2300#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2298#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2297#L456 assume !(0 == start_simulation_~tmp~3); 2292#L456-1 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; 2290#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 2289#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2285#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2282#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2277#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 2274#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2272#L469 assume !(0 != start_simulation_~tmp___0~2); 2094#L437-1 [2021-08-27 16:30:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 2 times [2021-08-27 16:30:04,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413024101] [2021-08-27 16:30:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,318 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,343 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash -409531438, now seen corresponding path program 1 times [2021-08-27 16:30:04,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569396849] [2021-08-27 16:30:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569396849] [2021-08-27 16:30:04,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569396849] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:30:04,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954766715] [2021-08-27 16:30:04,407 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:30:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:30:04,409 INFO L87 Difference]: Start difference. First operand 327 states and 460 transitions. cyclomatic complexity: 134 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,480 INFO L93 Difference]: Finished difference Result 723 states and 1015 transitions. [2021-08-27 16:30:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:30:04,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 723 states and 1015 transitions. [2021-08-27 16:30:04,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 704 [2021-08-27 16:30:04,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 723 states to 723 states and 1015 transitions. [2021-08-27 16:30:04,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 723 [2021-08-27 16:30:04,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 723 [2021-08-27 16:30:04,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 723 states and 1015 transitions. [2021-08-27 16:30:04,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,489 INFO L681 BuchiCegarLoop]: Abstraction has 723 states and 1015 transitions. [2021-08-27 16:30:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states and 1015 transitions. [2021-08-27 16:30:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 339. [2021-08-27 16:30:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 339 states have (on average 1.3775811209439528) internal successors, (467), 338 states have internal predecessors, (467), 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-08-27 16:30:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2021-08-27 16:30:04,498 INFO L704 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-08-27 16:30:04,498 INFO L587 BuchiCegarLoop]: Abstraction has 339 states and 467 transitions. [2021-08-27 16:30:04,498 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 16:30:04,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 339 states and 467 transitions. [2021-08-27 16:30:04,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 320 [2021-08-27 16:30:04,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,501 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,502 INFO L791 eck$LassoCheckResult]: Stem: 3206#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3137#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3138#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3168#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3157#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3158#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3166#L109 assume !(1 == ~P_1_pc~0); 3202#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3148#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3126#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3103#L375 assume !(0 != activate_threads_~tmp~1); 3104#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3139#L191 assume !(1 == ~C_1_pc~0); 3175#L191-2 assume !(2 == ~C_1_pc~0); 3176#L201-1 is_C_1_triggered_~__retres1~1 := 0; 3179#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3180#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3153#L383 assume !(0 != activate_threads_~tmp___1~1); 3154#L437-1 [2021-08-27 16:30:04,502 INFO L793 eck$LassoCheckResult]: Loop: 3154#L437-1 assume !false; 3349#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3347#L296 assume !false; 3346#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3345#L246 assume !(0 == ~P_1_st~0); 3342#L250 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~2 := 0; 3340#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3335#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 3328#L276 assume !(0 != eval_~tmp___2~0); 3279#L312 start_simulation_~kernel_st~0 := 2; 3267#L221-1 start_simulation_~kernel_st~0 := 3; 3221#L323 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3222#L109-3 assume !(1 == ~P_1_pc~0); 3262#L109-5 is_P_1_triggered_~__retres1~0 := 0; 3260#L120-1 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3258#L121-1 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3256#L375-3 assume !(0 != activate_threads_~tmp~1); 3254#L375-5 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3252#L191-3 assume !(1 == ~C_1_pc~0); 3250#L191-5 assume !(2 == ~C_1_pc~0); 3248#L201-3 is_C_1_triggered_~__retres1~1 := 0; 3246#L212-1 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 3245#L213-1 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3244#L383-3 assume !(0 != activate_threads_~tmp___1~1); 3243#L383-5 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3241#L246-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3240#L259-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3239#L260-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3237#L456 assume !(0 == start_simulation_~tmp~3); 3238#L456-1 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; 3370#L246-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 3369#L259-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3368#L260-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 3367#L411 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3366#L418 stop_simulation_#res := stop_simulation_~__retres2~0; 3365#L419 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 3364#L469 assume !(0 != start_simulation_~tmp___0~2); 3154#L437-1 [2021-08-27 16:30:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1930997989, now seen corresponding path program 3 times [2021-08-27 16:30:04,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139206975] [2021-08-27 16:30:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,513 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,522 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash 13170388, now seen corresponding path program 1 times [2021-08-27 16:30:04,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135364975] [2021-08-27 16:30:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135364975] [2021-08-27 16:30:04,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135364975] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168985153] [2021-08-27 16:30:04,545 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:30:04,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,546 INFO L87 Difference]: Start difference. First operand 339 states and 467 transitions. cyclomatic complexity: 129 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,569 INFO L93 Difference]: Finished difference Result 493 states and 667 transitions. [2021-08-27 16:30:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 667 transitions. [2021-08-27 16:30:04,572 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-08-27 16:30:04,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 493 states and 667 transitions. [2021-08-27 16:30:04,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 493 [2021-08-27 16:30:04,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 493 [2021-08-27 16:30:04,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 667 transitions. [2021-08-27 16:30:04,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,576 INFO L681 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-27 16:30:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 667 transitions. [2021-08-27 16:30:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2021-08-27 16:30:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 493 states have (on average 1.3529411764705883) internal successors, (667), 492 states have internal predecessors, (667), 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-08-27 16:30:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 667 transitions. [2021-08-27 16:30:04,584 INFO L704 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-27 16:30:04,584 INFO L587 BuchiCegarLoop]: Abstraction has 493 states and 667 transitions. [2021-08-27 16:30:04,584 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 16:30:04,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states and 667 transitions. [2021-08-27 16:30:04,586 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 468 [2021-08-27 16:30:04,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,587 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,588 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,588 INFO L791 eck$LassoCheckResult]: Stem: 4051#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3974#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 3975#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 4007#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3996#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3997#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4005#L109 assume !(1 == ~P_1_pc~0); 4047#L109-2 is_P_1_triggered_~__retres1~0 := 0; 3986#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3963#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3940#L375 assume !(0 != activate_threads_~tmp~1); 3941#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 3976#L191 assume !(1 == ~C_1_pc~0); 4016#L191-2 assume !(2 == ~C_1_pc~0); 4017#L201-1 is_C_1_triggered_~__retres1~1 := 0; 4020#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 4021#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3992#L383 assume !(0 != activate_threads_~tmp___1~1); 3993#L437-1 assume !false; 4371#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4010#L296 [2021-08-27 16:30:04,588 INFO L793 eck$LassoCheckResult]: Loop: 4010#L296 assume !false; 4369#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4367#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 4368#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4378#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 4377#L276 assume 0 != eval_~tmp___2~0; 4375#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4049#L285 assume !(0 != eval_~tmp~0); 4050#L281 assume !(0 == ~C_1_st~0); 4010#L296 [2021-08-27 16:30:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 1 times [2021-08-27 16:30:04,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722534371] [2021-08-27 16:30:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,602 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1487904191, now seen corresponding path program 1 times [2021-08-27 16:30:04,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917480595] [2021-08-27 16:30:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,639 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 489258489, now seen corresponding path program 1 times [2021-08-27 16:30:04,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111888989] [2021-08-27 16:30:04,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111888989] [2021-08-27 16:30:04,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111888989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:30:04,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362774464] [2021-08-27 16:30:04,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,766 INFO L87 Difference]: Start difference. First operand 493 states and 667 transitions. cyclomatic complexity: 177 Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-08-27 16:30:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,803 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2021-08-27 16:30:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 801 states and 1061 transitions. [2021-08-27 16:30:04,807 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-27 16:30:04,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 801 states to 801 states and 1061 transitions. [2021-08-27 16:30:04,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2021-08-27 16:30:04,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2021-08-27 16:30:04,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 801 states and 1061 transitions. [2021-08-27 16:30:04,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,811 INFO L681 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-27 16:30:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states and 1061 transitions. [2021-08-27 16:30:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2021-08-27 16:30:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 801 states have (on average 1.3245942571785267) internal successors, (1061), 800 states have internal predecessors, (1061), 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-08-27 16:30:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1061 transitions. [2021-08-27 16:30:04,848 INFO L704 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-27 16:30:04,848 INFO L587 BuchiCegarLoop]: Abstraction has 801 states and 1061 transitions. [2021-08-27 16:30:04,848 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 16:30:04,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 1061 transitions. [2021-08-27 16:30:04,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-27 16:30:04,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:04,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:04,852 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,852 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:04,852 INFO L791 eck$LassoCheckResult]: Stem: 5364#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 5277#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 5278#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5314#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5300#L228-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 5301#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5312#L109 assume !(1 == ~P_1_pc~0); 5366#L109-2 is_P_1_triggered_~__retres1~0 := 0; 5367#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5263#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5264#L375 assume !(0 != activate_threads_~tmp~1); 5596#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 5593#L191 assume !(1 == ~C_1_pc~0); 5591#L191-2 assume !(2 == ~C_1_pc~0); 5580#L201-1 is_C_1_triggered_~__retres1~1 := 0; 5579#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 5578#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5576#L383 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5295#L437-1 assume !false; 5745#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5706#L296 [2021-08-27 16:30:04,852 INFO L793 eck$LassoCheckResult]: Loop: 5706#L296 assume !false; 5738#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5734#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 5730#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5725#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 5721#L276 assume 0 != eval_~tmp___2~0; 5718#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5715#L285 assume !(0 != eval_~tmp~0); 5713#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 5504#L300 assume !(0 != eval_~tmp___1~0); 5706#L296 [2021-08-27 16:30:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash -757871933, now seen corresponding path program 1 times [2021-08-27 16:30:04,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70900482] [2021-08-27 16:30:04,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:30:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 16:30:04,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:30:04,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70900482] [2021-08-27 16:30:04,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70900482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:30:04,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:30:04,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:30:04,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132180352] [2021-08-27 16:30:04,868 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:30:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 1 times [2021-08-27 16:30:04,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:04,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708513386] [2021-08-27 16:30:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:04,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,871 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:04,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:04,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:30:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:30:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:30:04,977 INFO L87 Difference]: Start difference. First operand 801 states and 1061 transitions. cyclomatic complexity: 263 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:30:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:30:04,983 INFO L93 Difference]: Finished difference Result 785 states and 1041 transitions. [2021-08-27 16:30:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:30:04,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1041 transitions. [2021-08-27 16:30:04,987 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-27 16:30:04,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1041 transitions. [2021-08-27 16:30:04,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 785 [2021-08-27 16:30:04,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 785 [2021-08-27 16:30:04,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1041 transitions. [2021-08-27 16:30:04,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:30:04,993 INFO L681 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-27 16:30:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1041 transitions. [2021-08-27 16:30:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2021-08-27 16:30:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 785 states have (on average 1.3261146496815286) internal successors, (1041), 784 states have internal predecessors, (1041), 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-08-27 16:30:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1041 transitions. [2021-08-27 16:30:05,004 INFO L704 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-27 16:30:05,004 INFO L587 BuchiCegarLoop]: Abstraction has 785 states and 1041 transitions. [2021-08-27 16:30:05,004 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 16:30:05,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 785 states and 1041 transitions. [2021-08-27 16:30:05,008 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 756 [2021-08-27 16:30:05,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:30:05,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:30:05,008 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:05,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:30:05,009 INFO L791 eck$LassoCheckResult]: Stem: 6949#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(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6867#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~C_1_i~0 := 1; 6868#L488 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 6903#L221 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6890#L228-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6891#L233-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6899#L109 assume !(1 == ~P_1_pc~0); 6942#L109-2 is_P_1_triggered_~__retres1~0 := 0; 6879#L120 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6855#L121 activate_threads_#t~ret11 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6835#L375 assume !(0 != activate_threads_~tmp~1); 6836#L375-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~1;havoc is_C_1_triggered_~__retres1~1; 6874#L191 assume !(1 == ~C_1_pc~0); 6909#L191-2 assume !(2 == ~C_1_pc~0); 6910#L201-1 is_C_1_triggered_~__retres1~1 := 0; 6913#L212 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~1; 6914#L213 activate_threads_#t~ret12 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6884#L383 assume !(0 != activate_threads_~tmp___1~1); 6885#L437-1 assume !false; 7179#L438 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_#t~nondet10, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 7156#L296 [2021-08-27 16:30:05,009 INFO L793 eck$LassoCheckResult]: Loop: 7156#L296 assume !false; 7177#L272 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7175#L246 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~2 := 1; 7173#L259 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7171#L260 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret8;havoc eval_#t~ret8; 7169#L276 assume 0 != eval_~tmp___2~0; 7167#L276-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 7164#L285 assume !(0 != eval_~tmp~0); 7161#L281 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 7155#L300 assume !(0 != eval_~tmp___1~0); 7156#L296 [2021-08-27 16:30:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 263198343, now seen corresponding path program 2 times [2021-08-27 16:30:05,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308694425] [2021-08-27 16:30:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,021 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1119612439, now seen corresponding path program 2 times [2021-08-27 16:30:05,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947797141] [2021-08-27 16:30:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,033 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,035 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:30:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash -2012858129, now seen corresponding path program 1 times [2021-08-27 16:30:05,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:30:05,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28992460] [2021-08-27 16:30:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:30:05,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:30:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,041 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:30:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:30:05,053 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:30:05,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:30:05 BoogieIcfgContainer [2021-08-27 16:30:05,950 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:30:05,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:30:05,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:30:05,951 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:30:05,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:30:03" (3/4) ... [2021-08-27 16:30:05,954 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 16:30:05,988 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 16:30:05,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:30:05,990 INFO L168 Benchmark]: Toolchain (without parser) took 3566.56 ms. Allocated memory was 54.5 MB in the beginning and 125.8 MB in the end (delta: 71.3 MB). Free memory was 32.0 MB in the beginning and 67.3 MB in the end (delta: -35.3 MB). Peak memory consumption was 35.5 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,990 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.2 MB in the beginning and 36.2 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:30:05,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.61 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.8 MB in the beginning and 51.8 MB in the end (delta: -20.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.20 ms. Allocated memory is still 69.2 MB. Free memory was 51.8 MB in the beginning and 49.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,991 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 69.2 MB. Free memory was 49.4 MB in the beginning and 47.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,991 INFO L168 Benchmark]: RCFGBuilder took 457.41 ms. Allocated memory is still 69.2 MB. Free memory was 47.6 MB in the beginning and 45.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,991 INFO L168 Benchmark]: BuchiAutomizer took 2701.77 ms. Allocated memory was 69.2 MB in the beginning and 125.8 MB in the end (delta: 56.6 MB). Free memory was 45.2 MB in the beginning and 69.3 MB in the end (delta: -24.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,991 INFO L168 Benchmark]: Witness Printer took 37.80 ms. Allocated memory is still 125.8 MB. Free memory was 69.3 MB in the beginning and 67.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:30:05,993 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.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.2 MB in the beginning and 36.2 MB in the end (delta: 37.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 286.61 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 31.8 MB in the beginning and 51.8 MB in the end (delta: -20.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.20 ms. Allocated memory is still 69.2 MB. Free memory was 51.8 MB in the beginning and 49.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 69.2 MB. Free memory was 49.4 MB in the beginning and 47.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 457.41 ms. Allocated memory is still 69.2 MB. Free memory was 47.6 MB in the beginning and 45.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2701.77 ms. Allocated memory was 69.2 MB in the beginning and 125.8 MB in the end (delta: 56.6 MB). Free memory was 45.2 MB in the beginning and 69.3 MB in the end (delta: -24.1 MB). Peak memory consumption was 50.6 MB. Max. memory is 16.1 GB. * Witness Printer took 37.80 ms. Allocated memory is still 125.8 MB. Free memory was 69.3 MB in the beginning and 67.3 MB in the end (delta: 2.0 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 8 terminating modules (8 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.8 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 785 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 147.5ms AutomataMinimizationTime, 8 MinimizatonAttempts, 704 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 801 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1213 SDtfs, 1658 SDslu, 1640 SDs, 0 SdLazy, 174 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 203.0ms Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI3 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: 271]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {count=0, NULL=0, \result=0, P_1_pc=0, NULL=1, C_1_i=1, tmp=0, C_1_st=0, data_0=0, kernel_st=1, tmp___2=1, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43da7947=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13255fe5=0, NULL=0, NULL=0, \result=0, i=0, P_1_i=1, e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42ac07b3=0, __retres1=0, tmp___0=0, num=0, NULL=0, P_1_ev=0, tmp=0, C_1_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b7a087b=0, NULL=3, \result=0, __retres1=0, tmp___0=0, tmp___1=0, data_1=0, __retres1=1, max_loop=2, NULL=5, NULL=0, tmp=0, NULL=4, C_1_pr=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2c9380a0=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c07eeb5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fa64b8c=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 271]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; [L109] COND FALSE !((int )P_1_pc == 1) [L119] __retres1 = 0 [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) [L188] int __retres1 ; [L191] COND FALSE !((int )C_1_pc == 1) [L201] COND FALSE !((int )C_1_pc == 2) [L211] __retres1 = 0 [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L437] COND TRUE 1 [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; Loop: [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 16:30:06,048 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...