./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.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 da1ee67f9d4a34134c6c682362ba77c4c77858b09ffe0620532fe4446dd160da --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:59:47,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:59:47,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:59:47,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:59:47,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:59:47,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:59:47,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:59:47,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:59:47,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:59:47,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:59:47,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:59:47,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:59:47,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:59:47,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:59:47,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:59:47,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:59:47,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:59:47,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:59:47,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:59:47,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:59:47,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:59:47,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:59:47,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:59:47,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:59:47,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:59:47,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:59:47,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:59:47,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:59:47,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:59:47,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:59:47,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:59:47,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:59:47,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:59:47,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:59:47,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:59:47,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:59:47,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:59:47,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:59:47,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:59:47,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:59:47,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:59:47,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:59:47,183 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:59:47,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:59:47,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:59:47,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:59:47,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:59:47,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:59:47,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:59:47,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:59:47,186 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:59:47,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:59:47,187 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:59:47,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:59:47,189 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:59:47,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:59:47,189 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:59:47,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:59:47,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:59:47,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:59:47,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:59:47,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:47,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:59:47,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:59:47,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:59:47,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:59:47,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:59:47,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:59:47,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:59:47,192 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:59:47,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:59:47,192 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:59:47,192 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> da1ee67f9d4a34134c6c682362ba77c4c77858b09ffe0620532fe4446dd160da Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:59:47,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:59:47,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:59:47,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:59:47,520 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:59:47,521 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:59:47,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-09-01 09:59:48,702 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:59:49,071 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:59:49,072 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2023-09-01 09:59:49,094 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d42c455/577a0af69340444fb0cb42cc79d4ea91/FLAG1e03790e5 [2023-09-01 09:59:49,116 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d42c455/577a0af69340444fb0cb42cc79d4ea91 [2023-09-01 09:59:49,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:59:49,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:59:49,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:49,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:59:49,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:59:49,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:49" (1/1) ... [2023-09-01 09:59:49,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694ca9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:49, skipping insertion in model container [2023-09-01 09:59:49,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:49" (1/1) ... [2023-09-01 09:59:49,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:59:49,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:59:49,362 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-01 09:59:49,808 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2023-09-01 09:59:49,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:49,850 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:59:49,860 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-01 09:59:49,903 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2023-09-01 09:59:49,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:50,025 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:50,025 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:50,025 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:50,029 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:59:50,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50 WrapperNode [2023-09-01 09:59:50,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:50,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:50,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:59:50,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:59:50,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,097 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2023-09-01 09:59:50,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:50,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:59:50,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:59:50,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:59:50,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,127 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:59:50,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:59:50,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:59:50,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:59:50,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (1/1) ... [2023-09-01 09:59:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:50,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:59:50,170 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) [2023-09-01 09:59:50,218 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 [2023-09-01 09:59:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:59:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:59:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:59:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:59:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-09-01 09:59:50,233 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:59:50,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:59:50,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:59:50,235 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:59:50,547 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:59:50,549 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:59:50,733 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:59:50,766 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:59:50,766 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:59:50,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:50 BoogieIcfgContainer [2023-09-01 09:59:50,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:59:50,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:59:50,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:59:50,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:59:50,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:59:49" (1/3) ... [2023-09-01 09:59:50,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:50, skipping insertion in model container [2023-09-01 09:59:50,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:50" (2/3) ... [2023-09-01 09:59:50,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:50, skipping insertion in model container [2023-09-01 09:59:50,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:50" (3/3) ... [2023-09-01 09:59:50,775 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2023-09-01 09:59:50,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:59:50,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:59:50,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-09-01 09:59:50,790 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:59:50,867 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 09:59:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 334 flow [2023-09-01 09:59:50,994 INFO L130 PetriNetUnfolder]: 8/203 cut-off events. [2023-09-01 09:59:50,994 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 09:59:50,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 203 events. 8/203 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 392 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 110. Up to 4 conditions per place. [2023-09-01 09:59:50,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 334 flow [2023-09-01 09:59:51,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 147 transitions, 306 flow [2023-09-01 09:59:51,010 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:59:51,023 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 147 transitions, 306 flow [2023-09-01 09:59:51,026 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 147 transitions, 306 flow [2023-09-01 09:59:51,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 147 transitions, 306 flow [2023-09-01 09:59:51,089 INFO L130 PetriNetUnfolder]: 5/184 cut-off events. [2023-09-01 09:59:51,090 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 09:59:51,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 5/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 343 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 100. Up to 4 conditions per place. [2023-09-01 09:59:51,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 2704 [2023-09-01 09:59:58,682 INFO L134 LiptonReduction]: Checked pairs total: 7350 [2023-09-01 09:59:58,682 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-09-01 09:59:58,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:59:58,703 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4904d57f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:59:58,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-09-01 09:59:58,708 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2023-09-01 09:59:58,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:58,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:58,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 09:59:58,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 09:59:58,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 17980668, now seen corresponding path program 1 times [2023-09-01 09:59:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458213620] [2023-09-01 09:59:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:59,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458213620] [2023-09-01 09:59:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458213620] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:59,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:59,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446471475] [2023-09-01 09:59:59,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:59,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:59,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:59,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 301 [2023-09-01 09:59:59,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2023-09-01 09:59:59,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:59,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 301 [2023-09-01 09:59:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:59,710 INFO L130 PetriNetUnfolder]: 822/1436 cut-off events. [2023-09-01 09:59:59,711 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-09-01 09:59:59,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1436 events. 822/1436 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7464 event pairs, 577 based on Foata normal form. 0/1290 useless extension candidates. Maximal degree in co-relation 2748. Up to 1133 conditions per place. [2023-09-01 09:59:59,721 INFO L137 encePairwiseOnDemand]: 292/301 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-09-01 09:59:59,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 194 flow [2023-09-01 09:59:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:59:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:59:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-09-01 09:59:59,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673311184939092 [2023-09-01 09:59:59,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-09-01 09:59:59,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-09-01 09:59:59,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:59,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-09-01 09:59:59,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2023-09-01 09:59:59,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 09:59:59,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 09:59:59,761 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 84 flow. Second operand 3 states and 422 transitions. [2023-09-01 09:59:59,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 194 flow [2023-09-01 09:59:59,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:59,770 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 124 flow [2023-09-01 09:59:59,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-09-01 09:59:59,776 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-09-01 09:59:59,777 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 124 flow [2023-09-01 09:59:59,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2023-09-01 09:59:59,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:59,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-09-01 09:59:59,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:59:59,781 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 09:59:59,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:59,789 INFO L85 PathProgramCache]: Analyzing trace with hash 18006410, now seen corresponding path program 1 times [2023-09-01 09:59:59,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:59,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784211289] [2023-09-01 09:59:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:59,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:59:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784211289] [2023-09-01 09:59:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784211289] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896198201] [2023-09-01 09:59:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:59,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 301 [2023-09-01 09:59:59,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-09-01 09:59:59,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:59,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 301 [2023-09-01 09:59:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 10:00:00,107 INFO L130 PetriNetUnfolder]: 634/1197 cut-off events. [2023-09-01 10:00:00,108 INFO L131 PetriNetUnfolder]: For 386/390 co-relation queries the response was YES. [2023-09-01 10:00:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 1197 events. 634/1197 cut-off events. For 386/390 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6756 event pairs, 545 based on Foata normal form. 1/1103 useless extension candidates. Maximal degree in co-relation 1292. Up to 1024 conditions per place. [2023-09-01 10:00:00,115 INFO L137 encePairwiseOnDemand]: 299/301 looper letters, 34 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-09-01 10:00:00,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 206 flow [2023-09-01 10:00:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 10:00:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 10:00:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-09-01 10:00:00,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169435215946844 [2023-09-01 10:00:00,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-09-01 10:00:00,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-09-01 10:00:00,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 10:00:00,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-09-01 10:00:00,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-09-01 10:00:00,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:00,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:00,124 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 124 flow. Second operand 3 states and 444 transitions. [2023-09-01 10:00:00,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 206 flow [2023-09-01 10:00:00,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 10:00:00,130 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 115 flow [2023-09-01 10:00:00,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2023-09-01 10:00:00,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-09-01 10:00:00,131 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 115 flow [2023-09-01 10:00:00,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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) [2023-09-01 10:00:00,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 10:00:00,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 10:00:00,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 10:00:00,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 10:00:00,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 10:00:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 557401203, now seen corresponding path program 1 times [2023-09-01 10:00:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 10:00:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959507713] [2023-09-01 10:00:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 10:00:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 10:00:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 10:00:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 10:00:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 10:00:00,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959507713] [2023-09-01 10:00:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959507713] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 10:00:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 10:00:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 10:00:00,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75299520] [2023-09-01 10:00:00,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 10:00:00,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 10:00:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 10:00:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 10:00:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 10:00:00,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 301 [2023-09-01 10:00:00,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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) [2023-09-01 10:00:00,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 10:00:00,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 301 [2023-09-01 10:00:00,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 10:00:00,627 INFO L130 PetriNetUnfolder]: 1049/1809 cut-off events. [2023-09-01 10:00:00,627 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2023-09-01 10:00:00,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 1809 events. 1049/1809 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9511 event pairs, 717 based on Foata normal form. 38/1710 useless extension candidates. Maximal degree in co-relation 4265. Up to 1460 conditions per place. [2023-09-01 10:00:00,636 INFO L137 encePairwiseOnDemand]: 294/301 looper letters, 43 selfloop transitions, 9 changer transitions 2/56 dead transitions. [2023-09-01 10:00:00,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 275 flow [2023-09-01 10:00:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 10:00:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 10:00:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-09-01 10:00:00,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46622369878183834 [2023-09-01 10:00:00,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-09-01 10:00:00,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-09-01 10:00:00,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 10:00:00,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-09-01 10:00:00,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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) [2023-09-01 10:00:00,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:00,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:00,642 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 115 flow. Second operand 3 states and 421 transitions. [2023-09-01 10:00:00,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 275 flow [2023-09-01 10:00:00,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 10:00:00,644 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 183 flow [2023-09-01 10:00:00,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2023-09-01 10:00:00,645 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-09-01 10:00:00,645 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 183 flow [2023-09-01 10:00:00,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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) [2023-09-01 10:00:00,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 10:00:00,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 10:00:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 10:00:00,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 10:00:00,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 10:00:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 682194293, now seen corresponding path program 1 times [2023-09-01 10:00:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 10:00:00,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555880066] [2023-09-01 10:00:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 10:00:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 10:00:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 10:00:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 10:00:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 10:00:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555880066] [2023-09-01 10:00:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555880066] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 10:00:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 10:00:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 10:00:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12023195] [2023-09-01 10:00:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 10:00:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 10:00:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 10:00:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 10:00:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 10:00:00,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 301 [2023-09-01 10:00:00,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-09-01 10:00:00,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 10:00:00,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 301 [2023-09-01 10:00:00,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 10:00:01,119 INFO L130 PetriNetUnfolder]: 1168/2049 cut-off events. [2023-09-01 10:00:01,119 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-09-01 10:00:01,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 2049 events. 1168/2049 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11759 event pairs, 627 based on Foata normal form. 0/1884 useless extension candidates. Maximal degree in co-relation 3355. Up to 1646 conditions per place. [2023-09-01 10:00:01,129 INFO L137 encePairwiseOnDemand]: 293/301 looper letters, 51 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2023-09-01 10:00:01,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 346 flow [2023-09-01 10:00:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 10:00:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 10:00:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-09-01 10:00:01,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695459579180509 [2023-09-01 10:00:01,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-09-01 10:00:01,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-09-01 10:00:01,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 10:00:01,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-09-01 10:00:01,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) [2023-09-01 10:00:01,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,136 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 183 flow. Second operand 3 states and 424 transitions. [2023-09-01 10:00:01,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 346 flow [2023-09-01 10:00:01,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 335 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 10:00:01,141 INFO L231 Difference]: Finished difference. Result has 44 places, 52 transitions, 242 flow [2023-09-01 10:00:01,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=44, PETRI_TRANSITIONS=52} [2023-09-01 10:00:01,142 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-09-01 10:00:01,142 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 52 transitions, 242 flow [2023-09-01 10:00:01,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-09-01 10:00:01,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 10:00:01,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 10:00:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 10:00:01,143 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 10:00:01,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 10:00:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash -326813030, now seen corresponding path program 1 times [2023-09-01 10:00:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 10:00:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929055412] [2023-09-01 10:00:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 10:00:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 10:00:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 10:00:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 10:00:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 10:00:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929055412] [2023-09-01 10:00:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929055412] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 10:00:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 10:00:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 10:00:01,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338043413] [2023-09-01 10:00:01,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 10:00:01,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 10:00:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 10:00:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 10:00:01,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 10:00:01,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 301 [2023-09-01 10:00:01,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 52 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-09-01 10:00:01,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 10:00:01,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 301 [2023-09-01 10:00:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 10:00:01,600 INFO L130 PetriNetUnfolder]: 1459/2535 cut-off events. [2023-09-01 10:00:01,600 INFO L131 PetriNetUnfolder]: For 2737/2737 co-relation queries the response was YES. [2023-09-01 10:00:01,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7537 conditions, 2535 events. 1459/2535 cut-off events. For 2737/2737 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14617 event pairs, 767 based on Foata normal form. 0/2406 useless extension candidates. Maximal degree in co-relation 3419. Up to 1974 conditions per place. [2023-09-01 10:00:01,616 INFO L137 encePairwiseOnDemand]: 293/301 looper letters, 57 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2023-09-01 10:00:01,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 483 flow [2023-09-01 10:00:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 10:00:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 10:00:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-09-01 10:00:01,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4706533776301218 [2023-09-01 10:00:01,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-09-01 10:00:01,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-09-01 10:00:01,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 10:00:01,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-09-01 10:00:01,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-09-01 10:00:01,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,623 INFO L175 Difference]: Start difference. First operand has 44 places, 52 transitions, 242 flow. Second operand 3 states and 425 transitions. [2023-09-01 10:00:01,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 483 flow [2023-09-01 10:00:01,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 427 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-09-01 10:00:01,628 INFO L231 Difference]: Finished difference. Result has 46 places, 62 transitions, 336 flow [2023-09-01 10:00:01,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=46, PETRI_TRANSITIONS=62} [2023-09-01 10:00:01,629 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-09-01 10:00:01,629 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 62 transitions, 336 flow [2023-09-01 10:00:01,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-09-01 10:00:01,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 10:00:01,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 10:00:01,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 10:00:01,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 10:00:01,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 10:00:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1671702265, now seen corresponding path program 1 times [2023-09-01 10:00:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 10:00:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89920669] [2023-09-01 10:00:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 10:00:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 10:00:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 10:00:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 10:00:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 10:00:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89920669] [2023-09-01 10:00:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89920669] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 10:00:01,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 10:00:01,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 10:00:01,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035163839] [2023-09-01 10:00:01,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 10:00:01,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 10:00:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 10:00:01,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 10:00:01,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 10:00:01,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 301 [2023-09-01 10:00:01,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 62 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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) [2023-09-01 10:00:01,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 10:00:01,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 301 [2023-09-01 10:00:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 10:00:01,884 INFO L130 PetriNetUnfolder]: 786/1444 cut-off events. [2023-09-01 10:00:01,884 INFO L131 PetriNetUnfolder]: For 2148/2210 co-relation queries the response was YES. [2023-09-01 10:00:01,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 1444 events. 786/1444 cut-off events. For 2148/2210 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8182 event pairs, 146 based on Foata normal form. 58/1414 useless extension candidates. Maximal degree in co-relation 901. Up to 1068 conditions per place. [2023-09-01 10:00:01,895 INFO L137 encePairwiseOnDemand]: 299/301 looper letters, 40 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-09-01 10:00:01,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 354 flow [2023-09-01 10:00:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 10:00:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 10:00:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-09-01 10:00:01,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48726467331118495 [2023-09-01 10:00:01,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-09-01 10:00:01,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-09-01 10:00:01,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 10:00:01,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-09-01 10:00:01,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 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) [2023-09-01 10:00:01,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 301.0) internal successors, (1204), 4 states have internal predecessors, (1204), 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) [2023-09-01 10:00:01,910 INFO L175 Difference]: Start difference. First operand has 46 places, 62 transitions, 336 flow. Second operand 3 states and 440 transitions. [2023-09-01 10:00:01,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 354 flow [2023-09-01 10:00:01,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 290 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-09-01 10:00:01,918 INFO L231 Difference]: Finished difference. Result has 37 places, 44 transitions, 186 flow [2023-09-01 10:00:01,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=301, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=37, PETRI_TRANSITIONS=44} [2023-09-01 10:00:01,919 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-09-01 10:00:01,920 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 44 transitions, 186 flow [2023-09-01 10:00:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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) [2023-09-01 10:00:01,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 10:00:01,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 10:00:01,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 10:00:01,921 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-09-01 10:00:01,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 10:00:01,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1672564077, now seen corresponding path program 1 times [2023-09-01 10:00:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 10:00:01,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948046911] [2023-09-01 10:00:01,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 10:00:01,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 10:00:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 10:00:01,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 10:00:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 10:00:02,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 10:00:02,032 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 10:00:02,033 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-09-01 10:00:02,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-09-01 10:00:02,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-09-01 10:00:02,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-09-01 10:00:02,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-09-01 10:00:02,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-09-01 10:00:02,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-09-01 10:00:02,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-09-01 10:00:02,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 10:00:02,039 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-09-01 10:00:02,044 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 10:00:02,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 10:00:02,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 10:00:02 BasicIcfg [2023-09-01 10:00:02,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 10:00:02,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 10:00:02,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 10:00:02,099 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 10:00:02,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:50" (3/4) ... [2023-09-01 10:00:02,101 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 10:00:02,143 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 10:00:02,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 10:00:02,143 INFO L158 Benchmark]: Toolchain (without parser) took 13023.30ms. Allocated memory was 77.6MB in the beginning and 190.8MB in the end (delta: 113.2MB). Free memory was 51.3MB in the beginning and 119.2MB in the end (delta: -67.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,143 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 10:00:02,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 907.81ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 37.5MB in the end (delta: 13.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.68ms. Allocated memory is still 77.6MB. Free memory was 37.5MB in the beginning and 34.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,144 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 77.6MB. Free memory was 34.4MB in the beginning and 31.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,145 INFO L158 Benchmark]: RCFGBuilder took 633.38ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 31.6MB in the beginning and 42.2MB in the end (delta: -10.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,145 INFO L158 Benchmark]: TraceAbstraction took 11328.48ms. Allocated memory was 94.4MB in the beginning and 190.8MB in the end (delta: 96.5MB). Free memory was 41.5MB in the beginning and 124.4MB in the end (delta: -83.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,145 INFO L158 Benchmark]: Witness Printer took 44.08ms. Allocated memory is still 190.8MB. Free memory was 124.4MB in the beginning and 119.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 10:00:02,146 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.18ms. Allocated memory is still 60.8MB. Free memory is still 38.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 907.81ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 37.5MB in the end (delta: 13.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.68ms. Allocated memory is still 77.6MB. Free memory was 37.5MB in the beginning and 34.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 77.6MB. Free memory was 34.4MB in the beginning and 31.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 633.38ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 31.6MB in the beginning and 42.2MB in the end (delta: -10.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11328.48ms. Allocated memory was 94.4MB in the beginning and 190.8MB in the end (delta: 96.5MB). Free memory was 41.5MB in the beginning and 124.4MB in the end (delta: -83.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Witness Printer took 44.08ms. Allocated memory is still 190.8MB. Free memory was 124.4MB in the beginning and 119.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 149 PlacesBefore, 40 PlacesAfterwards, 147 TransitionsBefore, 36 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 2 ChoiceCompositions, 142 TotalNumberOfCompositions, 7350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2806, independent: 2511, independent conditional: 0, independent unconditional: 2511, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1400, independent: 1345, independent conditional: 0, independent unconditional: 1345, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2806, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 1400, unknown conditional: 0, unknown unconditional: 1400] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=0, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=1, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1723] 0 data->shared.a = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, status={7:0}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1726] 0 data->shared.b = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={7:0}, t1={3:0}, t2={4:0}] [L1729] EXPR 0 data->shared.a [L1729] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1675]: 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: 1713]: 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: 1714]: 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 4 procedures, 169 locations, 8 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: 11.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 547 IncrementalHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=5, InterpolantAutomatonStates: 18, 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.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 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! [2023-09-01 10:00:02,175 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