./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:39:17,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:39:17,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:39:17,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:39:17,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:39:17,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:39:17,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:39:17,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:39:17,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:39:17,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:39:17,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:39:17,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:39:17,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:39:17,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:39:17,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:39:17,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:39:17,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:39:17,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:39:17,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:39:17,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:39:17,111 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:39:17,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:39:17,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:39:17,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:39:17,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:39:17,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:39:17,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:39:17,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:39:17,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:39:17,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:39:17,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:39:17,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:39:17,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:39:17,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:39:17,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:39:17,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:39:17,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:39:17,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:39:17,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:39:17,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:39:17,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:39:17,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:39:17,136 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:39:17,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:39:17,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:39:17,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:39:17,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:39:17,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:39:17,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:39:17,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:39:17,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:39:17,162 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:39:17,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:39:17,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:39:17,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:39:17,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:39:17,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:39:17,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:39:17,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:39:17,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:39:17,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:39:17,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:39:17,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:39:17,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:39:17,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:39:17,167 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2022-07-21 08:39:17,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:39:17,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:39:17,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:39:17,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:39:17,450 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:39:17,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-07-21 08:39:17,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e623637a/c0a0152c85ba40f6869802d5c789bb8d/FLAG3dbc17bbc [2022-07-21 08:39:17,966 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:39:17,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-07-21 08:39:17,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e623637a/c0a0152c85ba40f6869802d5c789bb8d/FLAG3dbc17bbc [2022-07-21 08:39:17,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e623637a/c0a0152c85ba40f6869802d5c789bb8d [2022-07-21 08:39:17,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:39:17,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:39:17,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:39:17,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:39:17,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:39:17,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:39:17" (1/1) ... [2022-07-21 08:39:17,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c444855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:17, skipping insertion in model container [2022-07-21 08:39:17,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:39:17" (1/1) ... [2022-07-21 08:39:18,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:39:18,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:39:18,195 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-07-21 08:39:18,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:39:18,365 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:39:18,374 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-07-21 08:39:18,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:39:18,447 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:39:18,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18 WrapperNode [2022-07-21 08:39:18,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:39:18,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:39:18,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:39:18,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:39:18,453 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:39:18" (1/1) ... [2022-07-21 08:39:18,472 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:39:18" (1/1) ... [2022-07-21 08:39:18,488 INFO L137 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-07-21 08:39:18,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:39:18,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:39:18,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:39:18,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:39:18,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:39:18,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:39:18,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:39:18,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:39:18,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (1/1) ... [2022-07-21 08:39:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:39:18,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:39:18,558 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:39:18,571 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:39:18,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:39:18,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:39:18,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:39:18,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:39:18,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:39:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:39:18,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:39:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:39:18,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:39:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:39:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:39:18,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:39:18,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:39:18,627 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:39:18,743 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:39:18,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:39:19,157 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:39:19,380 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:39:19,381 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:39:19,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:19 BoogieIcfgContainer [2022-07-21 08:39:19,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:39:19,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:39:19,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:39:19,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:39:19,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:39:17" (1/3) ... [2022-07-21 08:39:19,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc4e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:39:19, skipping insertion in model container [2022-07-21 08:39:19,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:39:18" (2/3) ... [2022-07-21 08:39:19,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc4e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:39:19, skipping insertion in model container [2022-07-21 08:39:19,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:19" (3/3) ... [2022-07-21 08:39:19,388 INFO L111 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-07-21 08:39:19,391 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:39:19,397 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:39:19,397 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:39:19,397 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:39:19,435 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:39:19,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-07-21 08:39:19,485 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2022-07-21 08:39:19,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:39:19,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-07-21 08:39:19,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 97 transitions, 204 flow [2022-07-21 08:39:19,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 95 transitions, 196 flow [2022-07-21 08:39:19,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:39:19,500 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@67226c35, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@418cd116 [2022-07-21 08:39:19,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-21 08:39:19,506 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2022-07-21 08:39:19,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:39:19,507 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:19,507 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] [2022-07-21 08:39:19,508 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash -219724591, now seen corresponding path program 1 times [2022-07-21 08:39:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:19,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928835382] [2022-07-21 08:39:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:19,749 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:39:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:19,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928835382] [2022-07-21 08:39:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928835382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:19,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:39:19,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484147929] [2022-07-21 08:39:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:19,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:39:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:39:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:39:19,783 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2022-07-21 08:39:19,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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:39:19,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:19,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2022-07-21 08:39:19,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:19,874 INFO L129 PetriNetUnfolder]: 18/150 cut-off events. [2022-07-21 08:39:19,874 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-21 08:39:19,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 150 events. 18/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 354 event pairs, 2 based on Foata normal form. 8/148 useless extension candidates. Maximal degree in co-relation 153. Up to 31 conditions per place. [2022-07-21 08:39:19,877 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 10 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2022-07-21 08:39:19,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 223 flow [2022-07-21 08:39:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:39:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:39:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-07-21 08:39:19,891 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9347079037800687 [2022-07-21 08:39:19,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-07-21 08:39:19,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-07-21 08:39:19,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:19,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-07-21 08:39:19,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:39:19,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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:39:19,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 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:39:19,906 INFO L186 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 272 transitions. [2022-07-21 08:39:19,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 223 flow [2022-07-21 08:39:19,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:39:19,912 INFO L242 Difference]: Finished difference. Result has 98 places, 91 transitions, 190 flow [2022-07-21 08:39:19,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=98, PETRI_TRANSITIONS=91} [2022-07-21 08:39:19,916 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2022-07-21 08:39:19,917 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 91 transitions, 190 flow [2022-07-21 08:39:19,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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:39:19,918 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:19,918 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] [2022-07-21 08:39:19,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:39:19,918 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 996994642, now seen corresponding path program 1 times [2022-07-21 08:39:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:19,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731657951] [2022-07-21 08:39:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:20,085 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:39:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:20,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731657951] [2022-07-21 08:39:20,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731657951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:20,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:20,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:39:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089317541] [2022-07-21 08:39:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:20,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:39:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:39:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:39:20,092 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2022-07-21 08:39:20,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 91 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:39:20,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:20,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2022-07-21 08:39:20,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:20,405 INFO L129 PetriNetUnfolder]: 173/622 cut-off events. [2022-07-21 08:39:20,406 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-07-21 08:39:20,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 622 events. 173/622 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3466 event pairs, 40 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 947. Up to 166 conditions per place. [2022-07-21 08:39:20,410 INFO L132 encePairwiseOnDemand]: 91/97 looper letters, 16 selfloop transitions, 2 changer transitions 40/124 dead transitions. [2022-07-21 08:39:20,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 124 transitions, 368 flow [2022-07-21 08:39:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:39:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:39:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 744 transitions. [2022-07-21 08:39:20,413 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2022-07-21 08:39:20,413 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 744 transitions. [2022-07-21 08:39:20,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 744 transitions. [2022-07-21 08:39:20,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:20,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 744 transitions. [2022-07-21 08:39:20,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.66666666666667) internal successors, (744), 9 states have internal predecessors, (744), 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:39:20,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:39:20,418 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 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:39:20,418 INFO L186 Difference]: Start difference. First operand has 98 places, 91 transitions, 190 flow. Second operand 9 states and 744 transitions. [2022-07-21 08:39:20,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 124 transitions, 368 flow [2022-07-21 08:39:20,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:39:20,421 INFO L242 Difference]: Finished difference. Result has 111 places, 81 transitions, 186 flow [2022-07-21 08:39:20,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2022-07-21 08:39:20,422 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-07-21 08:39:20,422 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 186 flow [2022-07-21 08:39:20,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 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:39:20,422 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:20,422 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:39:20,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:39:20,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:20,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 784671092, now seen corresponding path program 1 times [2022-07-21 08:39:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:20,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649393223] [2022-07-21 08:39:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:20,567 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:39:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:20,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649393223] [2022-07-21 08:39:20,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649393223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:20,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:20,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:39:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331519139] [2022-07-21 08:39:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:39:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:39:20,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:39:20,572 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-07-21 08:39:20,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:39:20,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:20,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-07-21 08:39:20,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:20,783 INFO L129 PetriNetUnfolder]: 167/492 cut-off events. [2022-07-21 08:39:20,783 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-07-21 08:39:20,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 492 events. 167/492 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2417 event pairs, 18 based on Foata normal form. 0/480 useless extension candidates. Maximal degree in co-relation 846. Up to 79 conditions per place. [2022-07-21 08:39:20,785 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 24 selfloop transitions, 5 changer transitions 40/133 dead transitions. [2022-07-21 08:39:20,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 430 flow [2022-07-21 08:39:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:39:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:39:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 831 transitions. [2022-07-21 08:39:20,788 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.856701030927835 [2022-07-21 08:39:20,788 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 831 transitions. [2022-07-21 08:39:20,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 831 transitions. [2022-07-21 08:39:20,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:20,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 831 transitions. [2022-07-21 08:39:20,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.1) internal successors, (831), 10 states have internal predecessors, (831), 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:39:20,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:20,792 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:20,792 INFO L186 Difference]: Start difference. First operand has 111 places, 81 transitions, 186 flow. Second operand 10 states and 831 transitions. [2022-07-21 08:39:20,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 430 flow [2022-07-21 08:39:20,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 133 transitions, 414 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-07-21 08:39:20,796 INFO L242 Difference]: Finished difference. Result has 102 places, 82 transitions, 212 flow [2022-07-21 08:39:20,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2022-07-21 08:39:20,796 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 2 predicate places. [2022-07-21 08:39:20,797 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 212 flow [2022-07-21 08:39:20,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:39:20,797 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:20,797 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] [2022-07-21 08:39:20,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:39:20,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1069577311, now seen corresponding path program 1 times [2022-07-21 08:39:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063176145] [2022-07-21 08:39:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:20,911 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:39:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:20,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063176145] [2022-07-21 08:39:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063176145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:20,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:20,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:39:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445642307] [2022-07-21 08:39:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:20,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:39:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:39:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:39:20,913 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2022-07-21 08:39:20,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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:39:20,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:20,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2022-07-21 08:39:20,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:21,087 INFO L129 PetriNetUnfolder]: 35/183 cut-off events. [2022-07-21 08:39:21,087 INFO L130 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-07-21 08:39:21,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 183 events. 35/183 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 505 event pairs, 6 based on Foata normal form. 7/187 useless extension candidates. Maximal degree in co-relation 365. Up to 26 conditions per place. [2022-07-21 08:39:21,088 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 16 selfloop transitions, 7 changer transitions 19/106 dead transitions. [2022-07-21 08:39:21,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 106 transitions, 389 flow [2022-07-21 08:39:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:39:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:39:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 804 transitions. [2022-07-21 08:39:21,091 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8288659793814434 [2022-07-21 08:39:21,091 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 804 transitions. [2022-07-21 08:39:21,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 804 transitions. [2022-07-21 08:39:21,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:21,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 804 transitions. [2022-07-21 08:39:21,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 80.4) internal successors, (804), 10 states have internal predecessors, (804), 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:39:21,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,097 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,097 INFO L186 Difference]: Start difference. First operand has 102 places, 82 transitions, 212 flow. Second operand 10 states and 804 transitions. [2022-07-21 08:39:21,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 106 transitions, 389 flow [2022-07-21 08:39:21,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 350 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-07-21 08:39:21,103 INFO L242 Difference]: Finished difference. Result has 105 places, 82 transitions, 224 flow [2022-07-21 08:39:21,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=105, PETRI_TRANSITIONS=82} [2022-07-21 08:39:21,104 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2022-07-21 08:39:21,104 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 82 transitions, 224 flow [2022-07-21 08:39:21,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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:39:21,106 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:21,106 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:39:21,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:39:21,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:21,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1046660456, now seen corresponding path program 1 times [2022-07-21 08:39:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:21,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481665703] [2022-07-21 08:39:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:21,327 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:39:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:21,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481665703] [2022-07-21 08:39:21,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481665703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:21,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:21,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:39:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640739225] [2022-07-21 08:39:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:21,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:39:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:39:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:39:21,330 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2022-07-21 08:39:21,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 82 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 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:39:21,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:21,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2022-07-21 08:39:21,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:21,560 INFO L129 PetriNetUnfolder]: 26/181 cut-off events. [2022-07-21 08:39:21,561 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-07-21 08:39:21,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 181 events. 26/181 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 445 event pairs, 3 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 310. Up to 35 conditions per place. [2022-07-21 08:39:21,562 INFO L132 encePairwiseOnDemand]: 84/97 looper letters, 22 selfloop transitions, 13 changer transitions 8/103 dead transitions. [2022-07-21 08:39:21,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 103 transitions, 352 flow [2022-07-21 08:39:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:39:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:39:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 744 transitions. [2022-07-21 08:39:21,566 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7670103092783506 [2022-07-21 08:39:21,567 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 744 transitions. [2022-07-21 08:39:21,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 744 transitions. [2022-07-21 08:39:21,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:21,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 744 transitions. [2022-07-21 08:39:21,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 74.4) internal successors, (744), 10 states have internal predecessors, (744), 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:39:21,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,569 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,569 INFO L186 Difference]: Start difference. First operand has 105 places, 82 transitions, 224 flow. Second operand 10 states and 744 transitions. [2022-07-21 08:39:21,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 103 transitions, 352 flow [2022-07-21 08:39:21,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 306 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-07-21 08:39:21,572 INFO L242 Difference]: Finished difference. Result has 104 places, 92 transitions, 271 flow [2022-07-21 08:39:21,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=271, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2022-07-21 08:39:21,572 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2022-07-21 08:39:21,572 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 271 flow [2022-07-21 08:39:21,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 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:39:21,573 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:21,573 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:39:21,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:39:21,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:21,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1540856270, now seen corresponding path program 2 times [2022-07-21 08:39:21,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:21,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009964900] [2022-07-21 08:39:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:39:21,800 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:39:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:39:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009964900] [2022-07-21 08:39:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009964900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:39:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:39:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:39:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405455597] [2022-07-21 08:39:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:39:21,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:39:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:39:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:39:21,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:39:21,803 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2022-07-21 08:39:21,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 271 flow. Second operand has 9 states, 9 states have (on average 74.22222222222223) internal successors, (668), 9 states have internal predecessors, (668), 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:39:21,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:39:21,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2022-07-21 08:39:21,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:39:21,960 INFO L129 PetriNetUnfolder]: 19/193 cut-off events. [2022-07-21 08:39:21,960 INFO L130 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-07-21 08:39:21,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 193 events. 19/193 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 567 event pairs, 1 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 377. Up to 26 conditions per place. [2022-07-21 08:39:21,961 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 21 selfloop transitions, 6 changer transitions 12/105 dead transitions. [2022-07-21 08:39:21,961 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 405 flow [2022-07-21 08:39:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:39:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:39:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 753 transitions. [2022-07-21 08:39:21,963 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7762886597938145 [2022-07-21 08:39:21,963 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 753 transitions. [2022-07-21 08:39:21,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 753 transitions. [2022-07-21 08:39:21,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:39:21,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 753 transitions. [2022-07-21 08:39:21,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.3) internal successors, (753), 10 states have internal predecessors, (753), 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:39:21,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,966 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 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:39:21,966 INFO L186 Difference]: Start difference. First operand has 104 places, 92 transitions, 271 flow. Second operand 10 states and 753 transitions. [2022-07-21 08:39:21,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 105 transitions, 405 flow [2022-07-21 08:39:21,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 393 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-21 08:39:21,969 INFO L242 Difference]: Finished difference. Result has 111 places, 91 transitions, 284 flow [2022-07-21 08:39:21,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=284, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2022-07-21 08:39:21,970 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2022-07-21 08:39:21,970 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 284 flow [2022-07-21 08:39:21,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.22222222222223) internal successors, (668), 9 states have internal predecessors, (668), 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:39:21,970 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:39:21,970 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:39:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:39:21,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-07-21 08:39:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:39:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1713238694, now seen corresponding path program 3 times [2022-07-21 08:39:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:39:21,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788536386] [2022-07-21 08:39:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:39:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:39:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:39:22,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:39:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:39:22,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:39:22,048 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:39:22,048 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-07-21 08:39:22,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-21 08:39:22,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-07-21 08:39:22,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-07-21 08:39:22,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-21 08:39:22,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:39:22,051 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-07-21 08:39:22,054 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:39:22,055 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:39:22,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:39:22 BasicIcfg [2022-07-21 08:39:22,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:39:22,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:39:22,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:39:22,143 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:39:22,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:39:19" (3/4) ... [2022-07-21 08:39:22,151 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:39:22,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:39:22,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:39:22,218 INFO L158 Benchmark]: Toolchain (without parser) took 4225.16ms. Allocated memory was 67.1MB in the beginning and 132.1MB in the end (delta: 65.0MB). Free memory was 46.3MB in the beginning and 93.2MB in the end (delta: -46.9MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,218 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 67.1MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:39:22,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.00ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 38.4MB in the end (delta: 7.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.20ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,219 INFO L158 Benchmark]: Boogie Preprocessor took 20.79ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 33.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,219 INFO L158 Benchmark]: RCFGBuilder took 872.45ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 33.6MB in the beginning and 58.1MB in the end (delta: -24.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,220 INFO L158 Benchmark]: TraceAbstraction took 2758.42ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 58.1MB in the beginning and 41.4MB in the end (delta: 16.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,220 INFO L158 Benchmark]: Witness Printer took 75.46ms. Allocated memory is still 132.1MB. Free memory was 41.4MB in the beginning and 93.2MB in the end (delta: -51.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 08:39:22,221 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.19ms. Allocated memory is still 67.1MB. Free memory was 49.4MB in the beginning and 49.4MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.00ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 38.4MB in the end (delta: 7.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.20ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 35.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.79ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 33.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 872.45ms. Allocated memory was 67.1MB in the beginning and 90.2MB in the end (delta: 23.1MB). Free memory was 33.6MB in the beginning and 58.1MB in the end (delta: -24.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2758.42ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 58.1MB in the beginning and 41.4MB in the end (delta: 16.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 75.46ms. Allocated memory is still 132.1MB. Free memory was 41.4MB in the beginning and 93.2MB in the end (delta: -51.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L722] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L723] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L724] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L725] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L729] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L730] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L731] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L732] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L733] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L734] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L812] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={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] [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={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] [L814] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={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] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 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) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] 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) [L790] 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) [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L792] 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 [L793] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 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 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 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 [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 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 [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 815]: 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: 813]: 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, 116 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.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 46 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=6, InterpolantAutomatonStates: 52, 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.7s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:39:22,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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