./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix031.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:40:59,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:40:59,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:40:59,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:40:59,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:40:59,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:40:59,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:40:59,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:40:59,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:40:59,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:40:59,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:40:59,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:40:59,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:40:59,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:40:59,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:40:59,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:40:59,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:40:59,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:40:59,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:40:59,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:40:59,347 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:40:59,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:40:59,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:40:59,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:40:59,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:40:59,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:40:59,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:40:59,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:40:59,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:40:59,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:40:59,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:40:59,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:40:59,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:40:59,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:40:59,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:40:59,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:40:59,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:40:59,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:40:59,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:40:59,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:40:59,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:40:59,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:40:59,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:40:59,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:40:59,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:40:59,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:40:59,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:40:59,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:40:59,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:40:59,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:40:59,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:40:59,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:40:59,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:40:59,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:40:59,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:40:59,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:40:59,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:40:59,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:40:59,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:40:59,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:40:59,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:40:59,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 526111e98fa506d5405af18114114ae6aa9ce1a2e8442e7719052c05a249c119 [2022-07-21 08:40:59,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:40:59,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:40:59,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:40:59,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:40:59,704 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:40:59,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031.opt.i [2022-07-21 08:40:59,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deed301e/27ce2a7602ef449da78456943cf72f76/FLAG70f4f58a7 [2022-07-21 08:41:00,151 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:41:00,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i [2022-07-21 08:41:00,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deed301e/27ce2a7602ef449da78456943cf72f76/FLAG70f4f58a7 [2022-07-21 08:41:00,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9deed301e/27ce2a7602ef449da78456943cf72f76 [2022-07-21 08:41:00,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:41:00,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:41:00,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:41:00,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:41:00,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:41:00,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:00,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50729274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00, skipping insertion in model container [2022-07-21 08:41:00,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:00,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:41:00,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:41:00,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000] [2022-07-21 08:41:00,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:41:00,870 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:41:00,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031.opt.i[987,1000] [2022-07-21 08:41:00,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:41:00,984 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:41:00,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00 WrapperNode [2022-07-21 08:41:00,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:41:00,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:41:00,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:41:00,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:41:00,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,049 INFO L137 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2022-07-21 08:41:01,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:41:01,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:41:01,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:41:01,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:41:01,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:41:01,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:41:01,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:41:01,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:41:01,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (1/1) ... [2022-07-21 08:41:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:41:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:41:01,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 08:41:01,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 08:41:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:41:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:41:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:41:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:41:01,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:41:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:41:01,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:41:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:41:01,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:41:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:41:01,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:41:01,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:41:01,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:41:01,198 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:41:01,339 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:41:01,340 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:41:01,749 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:41:02,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:41:02,029 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:41:02,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:02 BoogieIcfgContainer [2022-07-21 08:41:02,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:41:02,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:41:02,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:41:02,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:41:02,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:41:00" (1/3) ... [2022-07-21 08:41:02,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a31217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:41:02, skipping insertion in model container [2022-07-21 08:41:02,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:41:00" (2/3) ... [2022-07-21 08:41:02,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a31217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:41:02, skipping insertion in model container [2022-07-21 08:41:02,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:02" (3/3) ... [2022-07-21 08:41:02,038 INFO L111 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2022-07-21 08:41:02,042 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:41:02,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:41:02,048 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:41:02,048 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:41:02,090 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:41:02,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 102 transitions, 214 flow [2022-07-21 08:41:02,172 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2022-07-21 08:41:02,173 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:41:02,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2022-07-21 08:41:02,177 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 102 transitions, 214 flow [2022-07-21 08:41:02,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 206 flow [2022-07-21 08:41:02,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:41:02,198 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@724e7a80, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e2363ae [2022-07-21 08:41:02,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-21 08:41:02,217 INFO L129 PetriNetUnfolder]: 0/63 cut-off events. [2022-07-21 08:41:02,218 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:41:02,218 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:02,219 INFO L200 CegarLoopForPetriNet]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:02,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1263061345, now seen corresponding path program 1 times [2022-07-21 08:41:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296014762] [2022-07-21 08:41:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:02,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296014762] [2022-07-21 08:41:02,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296014762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:02,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:02,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:41:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353406171] [2022-07-21 08:41:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:41:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:41:02,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:41:02,508 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 102 [2022-07-21 08:41:02,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 100 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:02,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 102 [2022-07-21 08:41:02,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:02,598 INFO L129 PetriNetUnfolder]: 10/138 cut-off events. [2022-07-21 08:41:02,598 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 08:41:02,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 138 events. 10/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 267 event pairs, 2 based on Foata normal form. 7/139 useless extension candidates. Maximal degree in co-relation 121. Up to 17 conditions per place. [2022-07-21 08:41:02,601 INFO L132 encePairwiseOnDemand]: 97/102 looper letters, 7 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2022-07-21 08:41:02,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 98 transitions, 220 flow [2022-07-21 08:41:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:41:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:41:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2022-07-21 08:41:02,616 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-07-21 08:41:02,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2022-07-21 08:41:02,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2022-07-21 08:41:02,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:02,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2022-07-21 08:41:02,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,632 INFO L186 Difference]: Start difference. First operand has 105 places, 100 transitions, 206 flow. Second operand 3 states and 287 transitions. [2022-07-21 08:41:02,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 98 transitions, 220 flow [2022-07-21 08:41:02,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:41:02,638 INFO L242 Difference]: Finished difference. Result has 103 places, 96 transitions, 200 flow [2022-07-21 08:41:02,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2022-07-21 08:41:02,644 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -2 predicate places. [2022-07-21 08:41:02,644 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 200 flow [2022-07-21 08:41:02,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,645 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:02,645 INFO L200 CegarLoopForPetriNet]: trace 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, 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] [2022-07-21 08:41:02,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:41:02,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1667540217, now seen corresponding path program 1 times [2022-07-21 08:41:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673160625] [2022-07-21 08:41:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:02,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673160625] [2022-07-21 08:41:02,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673160625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:02,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:02,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699477812] [2022-07-21 08:41:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:02,905 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 102 [2022-07-21 08:41:02,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:02,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:02,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 102 [2022-07-21 08:41:02,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:03,174 INFO L129 PetriNetUnfolder]: 210/747 cut-off events. [2022-07-21 08:41:03,174 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-21 08:41:03,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 747 events. 210/747 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4461 event pairs, 34 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1119. Up to 189 conditions per place. [2022-07-21 08:41:03,178 INFO L132 encePairwiseOnDemand]: 96/102 looper letters, 23 selfloop transitions, 2 changer transitions 49/141 dead transitions. [2022-07-21 08:41:03,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 436 flow [2022-07-21 08:41:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:41:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:41:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2022-07-21 08:41:03,181 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8376906318082789 [2022-07-21 08:41:03,181 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2022-07-21 08:41:03,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2022-07-21 08:41:03,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:03,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2022-07-21 08:41:03,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,186 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,186 INFO L186 Difference]: Start difference. First operand has 103 places, 96 transitions, 200 flow. Second operand 9 states and 769 transitions. [2022-07-21 08:41:03,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 436 flow [2022-07-21 08:41:03,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 141 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:41:03,189 INFO L242 Difference]: Finished difference. Result has 116 places, 86 transitions, 196 flow [2022-07-21 08:41:03,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=196, PETRI_PLACES=116, PETRI_TRANSITIONS=86} [2022-07-21 08:41:03,190 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2022-07-21 08:41:03,190 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 86 transitions, 196 flow [2022-07-21 08:41:03,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,190 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:03,191 INFO L200 CegarLoopForPetriNet]: trace 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, 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] [2022-07-21 08:41:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:41:03,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1688984311, now seen corresponding path program 1 times [2022-07-21 08:41:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:03,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710485067] [2022-07-21 08:41:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:03,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710485067] [2022-07-21 08:41:03,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710485067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:03,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:03,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058178266] [2022-07-21 08:41:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:03,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:03,290 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 102 [2022-07-21 08:41:03,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 86 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 80.0) internal successors, (560), 7 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:03,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 102 [2022-07-21 08:41:03,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:03,474 INFO L129 PetriNetUnfolder]: 113/353 cut-off events. [2022-07-21 08:41:03,475 INFO L130 PetriNetUnfolder]: For 125/125 co-relation queries the response was YES. [2022-07-21 08:41:03,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 353 events. 113/353 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1344 event pairs, 37 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 647. Up to 106 conditions per place. [2022-07-21 08:41:03,476 INFO L132 encePairwiseOnDemand]: 94/102 looper letters, 18 selfloop transitions, 4 changer transitions 25/114 dead transitions. [2022-07-21 08:41:03,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 114 transitions, 367 flow [2022-07-21 08:41:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:41:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:41:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 829 transitions. [2022-07-21 08:41:03,479 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8127450980392157 [2022-07-21 08:41:03,479 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 829 transitions. [2022-07-21 08:41:03,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 829 transitions. [2022-07-21 08:41:03,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:03,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 829 transitions. [2022-07-21 08:41:03,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.9) internal successors, (829), 10 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,483 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,483 INFO L186 Difference]: Start difference. First operand has 116 places, 86 transitions, 196 flow. Second operand 10 states and 829 transitions. [2022-07-21 08:41:03,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 114 transitions, 367 flow [2022-07-21 08:41:03,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 333 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-21 08:41:03,487 INFO L242 Difference]: Finished difference. Result has 108 places, 86 transitions, 204 flow [2022-07-21 08:41:03,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=108, PETRI_TRANSITIONS=86} [2022-07-21 08:41:03,487 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2022-07-21 08:41:03,488 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 204 flow [2022-07-21 08:41:03,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.0) internal successors, (560), 7 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,488 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:03,488 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1] [2022-07-21 08:41:03,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:41:03,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1936429894, now seen corresponding path program 1 times [2022-07-21 08:41:03,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:03,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961909338] [2022-07-21 08:41:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961909338] [2022-07-21 08:41:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961909338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:03,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:41:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749986452] [2022-07-21 08:41:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:41:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:41:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:41:03,562 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2022-07-21 08:41:03,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 86 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:03,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2022-07-21 08:41:03,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:03,731 INFO L129 PetriNetUnfolder]: 122/394 cut-off events. [2022-07-21 08:41:03,731 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-07-21 08:41:03,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 394 events. 122/394 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1877 event pairs, 10 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 673. Up to 67 conditions per place. [2022-07-21 08:41:03,733 INFO L132 encePairwiseOnDemand]: 93/102 looper letters, 21 selfloop transitions, 5 changer transitions 35/131 dead transitions. [2022-07-21 08:41:03,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 131 transitions, 418 flow [2022-07-21 08:41:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:41:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:41:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 883 transitions. [2022-07-21 08:41:03,735 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.865686274509804 [2022-07-21 08:41:03,736 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 883 transitions. [2022-07-21 08:41:03,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 883 transitions. [2022-07-21 08:41:03,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:03,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 883 transitions. [2022-07-21 08:41:03,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.3) internal successors, (883), 10 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,739 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,739 INFO L186 Difference]: Start difference. First operand has 108 places, 86 transitions, 204 flow. Second operand 10 states and 883 transitions. [2022-07-21 08:41:03,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 131 transitions, 418 flow [2022-07-21 08:41:03,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 131 transitions, 398 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-07-21 08:41:03,742 INFO L242 Difference]: Finished difference. Result has 108 places, 87 transitions, 226 flow [2022-07-21 08:41:03,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2022-07-21 08:41:03,743 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2022-07-21 08:41:03,743 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 226 flow [2022-07-21 08:41:03,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,744 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:03,744 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1] [2022-07-21 08:41:03,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:41:03,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:03,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1190768077, now seen corresponding path program 1 times [2022-07-21 08:41:03,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:03,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424626330] [2022-07-21 08:41:03,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:03,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:03,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:03,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424626330] [2022-07-21 08:41:03,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424626330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:03,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:03,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370417023] [2022-07-21 08:41:03,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:03,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:03,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:03,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:03,849 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 102 [2022-07-21 08:41:03,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:03,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 102 [2022-07-21 08:41:03,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:03,977 INFO L129 PetriNetUnfolder]: 27/167 cut-off events. [2022-07-21 08:41:03,977 INFO L130 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-07-21 08:41:03,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 167 events. 27/167 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 439 event pairs, 3 based on Foata normal form. 6/172 useless extension candidates. Maximal degree in co-relation 323. Up to 24 conditions per place. [2022-07-21 08:41:03,978 INFO L132 encePairwiseOnDemand]: 94/102 looper letters, 14 selfloop transitions, 7 changer transitions 17/108 dead transitions. [2022-07-21 08:41:03,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 389 flow [2022-07-21 08:41:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:41:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:41:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 860 transitions. [2022-07-21 08:41:03,981 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2022-07-21 08:41:03,981 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 860 transitions. [2022-07-21 08:41:03,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 860 transitions. [2022-07-21 08:41:03,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:03,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 860 transitions. [2022-07-21 08:41:03,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,985 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,985 INFO L186 Difference]: Start difference. First operand has 108 places, 87 transitions, 226 flow. Second operand 10 states and 860 transitions. [2022-07-21 08:41:03,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 389 flow [2022-07-21 08:41:03,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 346 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-07-21 08:41:03,987 INFO L242 Difference]: Finished difference. Result has 110 places, 87 transitions, 234 flow [2022-07-21 08:41:03,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=234, PETRI_PLACES=110, PETRI_TRANSITIONS=87} [2022-07-21 08:41:03,988 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2022-07-21 08:41:03,989 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 234 flow [2022-07-21 08:41:03,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.85714285714286) internal successors, (587), 7 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:03,989 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:03,989 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:03,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:41:03,990 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1708991414, now seen corresponding path program 1 times [2022-07-21 08:41:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:03,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345765472] [2022-07-21 08:41:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:04,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:04,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345765472] [2022-07-21 08:41:04,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345765472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:04,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:04,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:41:04,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963344872] [2022-07-21 08:41:04,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:04,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:41:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:04,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:41:04,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:41:04,147 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 102 [2022-07-21 08:41:04,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 87 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:04,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 102 [2022-07-21 08:41:04,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:04,304 INFO L129 PetriNetUnfolder]: 12/167 cut-off events. [2022-07-21 08:41:04,305 INFO L130 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-07-21 08:41:04,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 167 events. 12/167 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 387 event pairs, 2 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 276. Up to 30 conditions per place. [2022-07-21 08:41:04,306 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 22 selfloop transitions, 8 changer transitions 7/100 dead transitions. [2022-07-21 08:41:04,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 334 flow [2022-07-21 08:41:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:41:04,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:41:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 695 transitions. [2022-07-21 08:41:04,310 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7570806100217865 [2022-07-21 08:41:04,310 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 695 transitions. [2022-07-21 08:41:04,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 695 transitions. [2022-07-21 08:41:04,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:04,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 695 transitions. [2022-07-21 08:41:04,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 77.22222222222223) internal successors, (695), 9 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,313 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 102.0) internal successors, (1020), 10 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,314 INFO L186 Difference]: Start difference. First operand has 110 places, 87 transitions, 234 flow. Second operand 9 states and 695 transitions. [2022-07-21 08:41:04,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 334 flow [2022-07-21 08:41:04,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 288 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-21 08:41:04,316 INFO L242 Difference]: Finished difference. Result has 108 places, 90 transitions, 237 flow [2022-07-21 08:41:04,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2022-07-21 08:41:04,319 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2022-07-21 08:41:04,319 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 237 flow [2022-07-21 08:41:04,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,320 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:04,320 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:04,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:41:04,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash -165495244, now seen corresponding path program 2 times [2022-07-21 08:41:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:04,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684707340] [2022-07-21 08:41:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:04,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:04,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684707340] [2022-07-21 08:41:04,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684707340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:04,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:04,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:41:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405595101] [2022-07-21 08:41:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:41:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:41:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:41:04,486 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-07-21 08:41:04,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:04,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-07-21 08:41:04,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:04,630 INFO L129 PetriNetUnfolder]: 17/190 cut-off events. [2022-07-21 08:41:04,630 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-07-21 08:41:04,631 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 190 events. 17/190 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 510 event pairs, 5 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 328. Up to 39 conditions per place. [2022-07-21 08:41:04,631 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 19 selfloop transitions, 8 changer transitions 11/104 dead transitions. [2022-07-21 08:41:04,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 104 transitions, 369 flow [2022-07-21 08:41:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:41:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:41:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 643 transitions. [2022-07-21 08:41:04,633 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7879901960784313 [2022-07-21 08:41:04,634 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 643 transitions. [2022-07-21 08:41:04,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 643 transitions. [2022-07-21 08:41:04,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:04,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 643 transitions. [2022-07-21 08:41:04,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.375) internal successors, (643), 8 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 102.0) internal successors, (918), 9 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,637 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 102.0) internal successors, (918), 9 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,637 INFO L186 Difference]: Start difference. First operand has 108 places, 90 transitions, 237 flow. Second operand 8 states and 643 transitions. [2022-07-21 08:41:04,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 104 transitions, 369 flow [2022-07-21 08:41:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 104 transitions, 334 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-07-21 08:41:04,639 INFO L242 Difference]: Finished difference. Result has 109 places, 90 transitions, 241 flow [2022-07-21 08:41:04,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=109, PETRI_TRANSITIONS=90} [2022-07-21 08:41:04,640 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2022-07-21 08:41:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 241 flow [2022-07-21 08:41:04,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,640 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:04,641 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:41:04,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1760868802, now seen corresponding path program 3 times [2022-07-21 08:41:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:04,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040561136] [2022-07-21 08:41:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:41:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:41:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:41:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040561136] [2022-07-21 08:41:04,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040561136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:41:04,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:41:04,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:41:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757629934] [2022-07-21 08:41:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:41:04,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:41:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:41:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:41:04,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:41:04,730 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-07-21 08:41:04,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 241 flow. Second operand has 8 states, 8 states have (on average 78.625) internal successors, (629), 8 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:41:04,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-07-21 08:41:04,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:41:04,835 INFO L129 PetriNetUnfolder]: 11/163 cut-off events. [2022-07-21 08:41:04,835 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-07-21 08:41:04,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 163 events. 11/163 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 346 event pairs, 4 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 283. Up to 27 conditions per place. [2022-07-21 08:41:04,836 INFO L132 encePairwiseOnDemand]: 92/102 looper letters, 16 selfloop transitions, 5 changer transitions 13/100 dead transitions. [2022-07-21 08:41:04,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 100 transitions, 347 flow [2022-07-21 08:41:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:41:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 08:41:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2022-07-21 08:41:04,838 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7867647058823529 [2022-07-21 08:41:04,838 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 642 transitions. [2022-07-21 08:41:04,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 642 transitions. [2022-07-21 08:41:04,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:41:04,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 642 transitions. [2022-07-21 08:41:04,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.25) internal successors, (642), 8 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 102.0) internal successors, (918), 9 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,841 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 102.0) internal successors, (918), 9 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,841 INFO L186 Difference]: Start difference. First operand has 109 places, 90 transitions, 241 flow. Second operand 8 states and 642 transitions. [2022-07-21 08:41:04,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 100 transitions, 347 flow [2022-07-21 08:41:04,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 100 transitions, 324 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-21 08:41:04,843 INFO L242 Difference]: Finished difference. Result has 110 places, 87 transitions, 222 flow [2022-07-21 08:41:04,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=110, PETRI_TRANSITIONS=87} [2022-07-21 08:41:04,843 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2022-07-21 08:41:04,843 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 222 flow [2022-07-21 08:41:04,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 78.625) internal successors, (629), 8 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:41:04,844 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:41:04,844 INFO L200 CegarLoopForPetriNet]: trace 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:41:04,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:41:04,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:41:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:41:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1559261672, now seen corresponding path program 4 times [2022-07-21 08:41:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:41:04,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007713140] [2022-07-21 08:41:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:41:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:41:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:41:04,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:41:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:41:04,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:41:04,917 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:41:04,918 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-21 08:41:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-21 08:41:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-21 08:41:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-21 08:41:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-21 08:41:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:41:04,919 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-07-21 08:41:04,923 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:41:04,923 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:41:05,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:41:05 BasicIcfg [2022-07-21 08:41:05,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:41:05,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:41:05,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:41:05,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:41:05,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:41:02" (3/4) ... [2022-07-21 08:41:05,039 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:41:05,121 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:41:05,121 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:41:05,122 INFO L158 Benchmark]: Toolchain (without parser) took 4585.39ms. Allocated memory was 50.3MB in the beginning and 157.3MB in the end (delta: 107.0MB). Free memory was 24.3MB in the beginning and 55.4MB in the end (delta: -31.1MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,122 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:41:05,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.60ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.1MB in the beginning and 36.2MB in the end (delta: -12.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.72ms. Allocated memory is still 65.0MB. Free memory was 36.0MB in the beginning and 46.8MB in the end (delta: -10.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,123 INFO L158 Benchmark]: Boogie Preprocessor took 28.13ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:41:05,123 INFO L158 Benchmark]: RCFGBuilder took 946.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.0MB in the beginning and 45.8MB in the end (delta: -810.7kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,123 INFO L158 Benchmark]: TraceAbstraction took 3004.13ms. Allocated memory was 79.7MB in the beginning and 157.3MB in the end (delta: 77.6MB). Free memory was 45.4MB in the beginning and 78.5MB in the end (delta: -33.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,124 INFO L158 Benchmark]: Witness Printer took 83.73ms. Allocated memory is still 157.3MB. Free memory was 78.5MB in the beginning and 55.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-21 08:41:05,126 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.16ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.60ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.1MB in the beginning and 36.2MB in the end (delta: -12.2MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.72ms. Allocated memory is still 65.0MB. Free memory was 36.0MB in the beginning and 46.8MB in the end (delta: -10.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.13ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 45.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 946.32ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 45.0MB in the beginning and 45.8MB in the end (delta: -810.7kB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3004.13ms. Allocated memory was 79.7MB in the beginning and 157.3MB in the end (delta: 77.6MB). Free memory was 45.4MB in the beginning and 78.5MB in the end (delta: -33.2MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * Witness Printer took 83.73ms. Allocated memory is still 157.3MB. Free memory was 78.5MB in the beginning and 55.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L727] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L728] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L730] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L731] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L732] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L733] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=6, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=7, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L832] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 123 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 436 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 592 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 93 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 582 ConstructedInterpolants, 0 QuantifiedInterpolants, 2879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:41:05,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE