/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-dev-ac9dbd0-m
[2023-08-24 05:38:09,515 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-08-24 05:38:09,581 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf
[2023-08-24 05:38:09,585 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-08-24 05:38:09,586 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2023-08-24 05:38:09,610 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-24 05:38:09,610 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-24 05:38:09,614 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-24 05:38:09,614 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-24 05:38:09,617 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-24 05:38:09,617 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-08-24 05:38:09,617 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-24 05:38:09,617 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-08-24 05:38:09,618 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-08-24 05:38:09,618 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-08-24 05:38:09,619 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-08-24 05:38:09,620 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-08-24 05:38:09,620 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-08-24 05:38:09,620 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-24 05:38:09,620 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-24 05:38:09,621 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-08-24 05:38:09,621 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-24 05:38:09,621 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-24 05:38:09,621 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-24 05:38:09,621 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-24 05:38:09,622 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-08-24 05:38:09,622 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-08-24 05:38:09,622 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-24 05:38:09,622 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-24 05:38:09,622 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-24 05:38:09,623 INFO  L153        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST
[2023-08-24 05:38:09,883 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-24 05:38:09,895 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-24 05:38:09,897 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-24 05:38:09,897 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-08-24 05:38:09,898 INFO  L274        PluginConnector]: CDTParser initialized
[2023-08-24 05:38:09,899 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i
[2023-08-24 05:38:10,791 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-08-24 05:38:11,024 INFO  L384              CDTParser]: Found 1 translation units.
[2023-08-24 05:38:11,024 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i
[2023-08-24 05:38:11,038 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95fc6d91a/2930801648e1491da3b577c33c059bec/FLAG63e878751
[2023-08-24 05:38:11,048 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95fc6d91a/2930801648e1491da3b577c33c059bec
[2023-08-24 05:38:11,052 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-24 05:38:11,053 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-08-24 05:38:11,055 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-24 05:38:11,055 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-24 05:38:11,056 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-24 05:38:11,057 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,058 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ba122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11, skipping insertion in model container
[2023-08-24 05:38:11,058 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,096 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2023-08-24 05:38:11,539 WARN  L240   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_1-container_of.i[76077,76090]
[2023-08-24 05:38:11,576 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-24 05:38:11,584 INFO  L201         MainTranslator]: Completed pre-run
[2023-08-24 05:38:11,606 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [237]
[2023-08-24 05:38:11,607 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [237]
[2023-08-24 05:38:11,610 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [729]
[2023-08-24 05:38:11,623 WARN  L240   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_1-container_of.i[76077,76090]
[2023-08-24 05:38:11,625 WARN  L75    lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned long [1709]
[2023-08-24 05:38:11,639 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-24 05:38:11,707 INFO  L206         MainTranslator]: Completed translation
[2023-08-24 05:38:11,708 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11 WrapperNode
[2023-08-24 05:38:11,710 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-24 05:38:11,711 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-24 05:38:11,711 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-24 05:38:11,712 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-24 05:38:11,716 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,735 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,753 INFO  L138                Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136
[2023-08-24 05:38:11,753 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-24 05:38:11,754 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-24 05:38:11,754 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-24 05:38:11,754 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-08-24 05:38:11,760 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,760 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,762 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,763 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,774 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,775 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,779 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,780 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,784 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-24 05:38:11,786 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-24 05:38:11,786 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-08-24 05:38:11,792 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-08-24 05:38:11,793 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (1/1) ...
[2023-08-24 05:38:11,796 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-24 05:38:11,804 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-24 05:38:11,812 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-08-24 05:38:11,815 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-08-24 05:38:11,842 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-24 05:38:11,842 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-08-24 05:38:11,842 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-08-24 05:38:11,842 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-24 05:38:11,843 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-08-24 05:38:11,843 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-24 05:38:11,843 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-24 05:38:11,843 INFO  L130     BoogieDeclarations]: Found specification of procedure my_callback
[2023-08-24 05:38:11,843 INFO  L138     BoogieDeclarations]: Found implementation of procedure my_callback
[2023-08-24 05:38:11,843 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-24 05:38:11,844 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-08-24 05:38:11,844 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-24 05:38:11,845 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-24 05:38:12,027 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-24 05:38:12,029 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-24 05:38:12,275 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-24 05:38:12,284 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-24 05:38:12,284 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-24 05:38:12,285 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:12 BoogieIcfgContainer
[2023-08-24 05:38:12,285 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-24 05:38:12,287 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-24 05:38:12,287 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-08-24 05:38:12,289 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-08-24 05:38:12,290 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:38:11" (1/3) ...
[2023-08-24 05:38:12,290 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a3117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:12, skipping insertion in model container
[2023-08-24 05:38:12,290 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:38:11" (2/3) ...
[2023-08-24 05:38:12,290 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a3117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:38:12, skipping insertion in model container
[2023-08-24 05:38:12,291 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:38:12" (3/3) ...
[2023-08-24 05:38:12,291 INFO  L112   eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i
[2023-08-24 05:38:12,303 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-24 05:38:12,303 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2023-08-24 05:38:12,304 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-24 05:38:12,361 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-08-24 05:38:12,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 177 places, 179 transitions, 374 flow
[2023-08-24 05:38:12,466 INFO  L124   PetriNetUnfolderBase]: 10/219 cut-off events.
[2023-08-24 05:38:12,467 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-08-24 05:38:12,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 228 conditions, 219 events. 10/219 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 397 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 128. Up to 4 conditions per place. 
[2023-08-24 05:38:12,471 INFO  L82        GeneralOperation]: Start removeDead. Operand has 177 places, 179 transitions, 374 flow
[2023-08-24 05:38:12,477 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 165 places, 165 transitions, 342 flow
[2023-08-24 05:38:12,479 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-24 05:38:12,490 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 165 transitions, 342 flow
[2023-08-24 05:38:12,493 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 165 transitions, 342 flow
[2023-08-24 05:38:12,493 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 165 places, 165 transitions, 342 flow
[2023-08-24 05:38:12,534 INFO  L124   PetriNetUnfolderBase]: 7/196 cut-off events.
[2023-08-24 05:38:12,534 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2023-08-24 05:38:12,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 7/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 325 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. 
[2023-08-24 05:38:12,537 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2820
[2023-08-24 05:38:22,540 INFO  L134        LiptonReduction]: Checked pairs total: 5993
[2023-08-24 05:38:22,540 INFO  L136        LiptonReduction]: Total number of compositions: 176
[2023-08-24 05:38:22,549 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-24 05:38:22,553 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=false, 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;@49aca406, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-24 05:38:22,553 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-08-24 05:38:22,554 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-08-24 05:38:22,554 INFO  L124   PetriNetUnfolderBase]: 0/0 cut-off events.
[2023-08-24 05:38:22,554 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-24 05:38:22,554 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-24 05:38:22,554 INFO  L208   CegarLoopForPetriNet]: trace histogram [1]
[2023-08-24 05:38:22,555 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2023-08-24 05:38:22,557 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-24 05:38:22,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times
[2023-08-24 05:38:22,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-24 05:38:22,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991166472]
[2023-08-24 05:38:22,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-24 05:38:22,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-24 05:38:22,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-24 05:38:22,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-24 05:38:22,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-24 05:38:22,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991166472]
[2023-08-24 05:38:22,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991166472] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-24 05:38:22,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-24 05:38:22,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-24 05:38:22,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034427678]
[2023-08-24 05:38:22,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-24 05:38:22,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-24 05:38:22,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-24 05:38:22,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-24 05:38:22,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-24 05:38:22,699 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 355
[2023-08-24 05:38:22,701 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 76 flow. Second operand  has 2 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 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-08-24 05:38:22,701 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-24 05:38:22,701 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 355
[2023-08-24 05:38:22,702 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-24 05:38:22,792 INFO  L124   PetriNetUnfolderBase]: 217/417 cut-off events.
[2023-08-24 05:38:22,792 INFO  L125   PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2023-08-24 05:38:22,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 827 conditions, 417 events. 217/417 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1941 event pairs, 216 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 736. Up to 391 conditions per place. 
[2023-08-24 05:38:22,798 INFO  L140   encePairwiseOnDemand]: 352/355 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions.
[2023-08-24 05:38:22,798 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 120 flow
[2023-08-24 05:38:22,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-08-24 05:38:22,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-24 05:38:22,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 354 transitions.
[2023-08-24 05:38:22,813 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49859154929577465
[2023-08-24 05:38:22,813 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 354 transitions.
[2023-08-24 05:38:22,814 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 354 transitions.
[2023-08-24 05:38:22,816 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-24 05:38:22,817 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 354 transitions.
[2023-08-24 05:38:22,821 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 177.0) internal successors, (354), 2 states have internal predecessors, (354), 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-08-24 05:38:22,823 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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-08-24 05:38:22,824 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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-08-24 05:38:22,825 INFO  L175             Difference]: Start difference. First operand has 36 places, 32 transitions, 76 flow. Second operand 2 states and 354 transitions.
[2023-08-24 05:38:22,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 120 flow
[2023-08-24 05:38:22,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-24 05:38:22,829 INFO  L231             Difference]: Finished difference. Result has 31 places, 29 transitions, 62 flow
[2023-08-24 05:38:22,830 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=29}
[2023-08-24 05:38:22,833 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places.
[2023-08-24 05:38:22,833 INFO  L495      AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 62 flow
[2023-08-24 05:38:22,833 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 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-08-24 05:38:22,834 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-24 05:38:22,834 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-08-24 05:38:22,834 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-24 05:38:22,834 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2023-08-24 05:38:22,840 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-24 05:38:22,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 18997458, now seen corresponding path program 1 times
[2023-08-24 05:38:22,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-24 05:38:22,840 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914721889]
[2023-08-24 05:38:22,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-24 05:38:22,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-24 05:38:22,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-24 05:38:23,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-24 05:38:23,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-24 05:38:23,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914721889]
[2023-08-24 05:38:23,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914721889] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-24 05:38:23,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-24 05:38:23,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-24 05:38:23,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954922633]
[2023-08-24 05:38:23,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-24 05:38:23,105 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-24 05:38:23,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-24 05:38:23,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-24 05:38:23,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-24 05:38:23,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 355
[2023-08-24 05:38:23,107 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 62 flow. Second operand  has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-08-24 05:38:23,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-24 05:38:23,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 355
[2023-08-24 05:38:23,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-24 05:38:23,249 INFO  L124   PetriNetUnfolderBase]: 639/1091 cut-off events.
[2023-08-24 05:38:23,249 INFO  L125   PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2023-08-24 05:38:23,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 1091 events. 639/1091 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5132 event pairs, 306 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 2189. Up to 767 conditions per place. 
[2023-08-24 05:38:23,254 INFO  L140   encePairwiseOnDemand]: 347/355 looper letters, 35 selfloop transitions, 7 changer transitions 0/42 dead transitions.
[2023-08-24 05:38:23,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 42 transitions, 172 flow
[2023-08-24 05:38:23,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-24 05:38:23,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-24 05:38:23,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions.
[2023-08-24 05:38:23,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40657276995305164
[2023-08-24 05:38:23,256 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 433 transitions.
[2023-08-24 05:38:23,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions.
[2023-08-24 05:38:23,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-24 05:38:23,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions.
[2023-08-24 05:38:23,257 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-08-24 05:38:23,260 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,261 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,261 INFO  L175             Difference]: Start difference. First operand has 31 places, 29 transitions, 62 flow. Second operand 3 states and 433 transitions.
[2023-08-24 05:38:23,261 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 42 transitions, 172 flow
[2023-08-24 05:38:23,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-24 05:38:23,262 INFO  L231             Difference]: Finished difference. Result has 35 places, 34 transitions, 112 flow
[2023-08-24 05:38:23,262 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=34}
[2023-08-24 05:38:23,263 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places.
[2023-08-24 05:38:23,263 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 112 flow
[2023-08-24 05:38:23,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-08-24 05:38:23,264 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-24 05:38:23,264 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-08-24 05:38:23,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-24 05:38:23,266 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-08-24 05:38:23,271 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-24 05:38:23,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 588920481, now seen corresponding path program 1 times
[2023-08-24 05:38:23,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-24 05:38:23,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596605339]
[2023-08-24 05:38:23,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-24 05:38:23,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-24 05:38:23,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-24 05:38:23,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-24 05:38:23,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-24 05:38:23,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596605339]
[2023-08-24 05:38:23,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596605339] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-24 05:38:23,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-24 05:38:23,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-24 05:38:23,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101469521]
[2023-08-24 05:38:23,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-24 05:38:23,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-24 05:38:23,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-24 05:38:23,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-24 05:38:23,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-24 05:38:23,449 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 355
[2023-08-24 05:38:23,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 112 flow. Second operand  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-08-24 05:38:23,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-24 05:38:23,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 355
[2023-08-24 05:38:23,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-24 05:38:23,638 INFO  L124   PetriNetUnfolderBase]: 755/1298 cut-off events.
[2023-08-24 05:38:23,638 INFO  L125   PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES.
[2023-08-24 05:38:23,640 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1298 events. 755/1298 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6422 event pairs, 422 based on Foata normal form. 37/1333 useless extension candidates. Maximal degree in co-relation 3354. Up to 992 conditions per place. 
[2023-08-24 05:38:23,645 INFO  L140   encePairwiseOnDemand]: 348/355 looper letters, 39 selfloop transitions, 9 changer transitions 2/50 dead transitions.
[2023-08-24 05:38:23,645 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 274 flow
[2023-08-24 05:38:23,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-24 05:38:23,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-24 05:38:23,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions.
[2023-08-24 05:38:23,647 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4056338028169014
[2023-08-24 05:38:23,647 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 432 transitions.
[2023-08-24 05:38:23,647 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions.
[2023-08-24 05:38:23,648 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-24 05:38:23,648 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions.
[2023-08-24 05:38:23,648 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-08-24 05:38:23,650 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,650 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,650 INFO  L175             Difference]: Start difference. First operand has 35 places, 34 transitions, 112 flow. Second operand 3 states and 432 transitions.
[2023-08-24 05:38:23,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 274 flow
[2023-08-24 05:38:23,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-24 05:38:23,656 INFO  L231             Difference]: Finished difference. Result has 36 places, 40 transitions, 169 flow
[2023-08-24 05:38:23,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=36, PETRI_TRANSITIONS=40}
[2023-08-24 05:38:23,658 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places.
[2023-08-24 05:38:23,660 INFO  L495      AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 169 flow
[2023-08-24 05:38:23,660 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-08-24 05:38:23,660 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-24 05:38:23,660 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-24 05:38:23,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-24 05:38:23,660 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2023-08-24 05:38:23,661 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-24 05:38:23,661 INFO  L85        PathProgramCache]: Analyzing trace with hash -108614993, now seen corresponding path program 1 times
[2023-08-24 05:38:23,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-24 05:38:23,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720227492]
[2023-08-24 05:38:23,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-24 05:38:23,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-24 05:38:23,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-24 05:38:23,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-24 05:38:23,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-24 05:38:23,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720227492]
[2023-08-24 05:38:23,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720227492] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-24 05:38:23,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-24 05:38:23,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-24 05:38:23,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210269170]
[2023-08-24 05:38:23,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-24 05:38:23,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-24 05:38:23,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-24 05:38:23,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-24 05:38:23,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-24 05:38:23,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355
[2023-08-24 05:38:23,732 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 169 flow. Second operand  has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-24 05:38:23,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-24 05:38:23,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355
[2023-08-24 05:38:23,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-24 05:38:23,791 INFO  L124   PetriNetUnfolderBase]: 105/208 cut-off events.
[2023-08-24 05:38:23,792 INFO  L125   PetriNetUnfolderBase]: For 170/200 co-relation queries the response was YES.
[2023-08-24 05:38:23,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 545 conditions, 208 events. 105/208 cut-off events. For 170/200 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 793 event pairs, 23 based on Foata normal form. 23/221 useless extension candidates. Maximal degree in co-relation 539. Up to 149 conditions per place. 
[2023-08-24 05:38:23,793 INFO  L140   encePairwiseOnDemand]: 353/355 looper letters, 25 selfloop transitions, 1 changer transitions 0/29 dead transitions.
[2023-08-24 05:38:23,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 142 flow
[2023-08-24 05:38:23,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-24 05:38:23,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-24 05:38:23,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions.
[2023-08-24 05:38:23,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4676056338028169
[2023-08-24 05:38:23,795 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 498 transitions.
[2023-08-24 05:38:23,795 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions.
[2023-08-24 05:38:23,795 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-24 05:38:23,795 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions.
[2023-08-24 05:38:23,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-08-24 05:38:23,797 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,798 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 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-08-24 05:38:23,798 INFO  L175             Difference]: Start difference. First operand has 36 places, 40 transitions, 169 flow. Second operand 3 states and 498 transitions.
[2023-08-24 05:38:23,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 142 flow
[2023-08-24 05:38:23,799 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 128 flow, removed 7 selfloop flow, removed 1 redundant places.
[2023-08-24 05:38:23,800 INFO  L231             Difference]: Finished difference. Result has 30 places, 22 transitions, 58 flow
[2023-08-24 05:38:23,800 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=30, PETRI_TRANSITIONS=22}
[2023-08-24 05:38:23,801 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places.
[2023-08-24 05:38:23,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 58 flow
[2023-08-24 05:38:23,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-08-24 05:38:23,801 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-24 05:38:23,801 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-24 05:38:23,801 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-24 05:38:23,802 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] ===
[2023-08-24 05:38:23,802 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-24 05:38:23,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -1902650914, now seen corresponding path program 1 times
[2023-08-24 05:38:23,802 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-24 05:38:23,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262172345]
[2023-08-24 05:38:23,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-24 05:38:23,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-24 05:38:23,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-24 05:38:23,985 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-24 05:38:24,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-24 05:38:24,046 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-24 05:38:24,046 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-24 05:38:24,047 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining)
[2023-08-24 05:38:24,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining)
[2023-08-24 05:38:24,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining)
[2023-08-24 05:38:24,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining)
[2023-08-24 05:38:24,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining)
[2023-08-24 05:38:24,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining)
[2023-08-24 05:38:24,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining)
[2023-08-24 05:38:24,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining)
[2023-08-24 05:38:24,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-24 05:38:24,050 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-08-24 05:38:24,056 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-24 05:38:24,056 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-24 05:38:24,110 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:38:24 BasicIcfg
[2023-08-24 05:38:24,110 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-24 05:38:24,111 INFO  L158              Benchmark]: Toolchain (without parser) took 13057.86ms. Allocated memory was 390.1MB in the beginning and 742.4MB in the end (delta: 352.3MB). Free memory was 362.8MB in the beginning and 474.5MB in the end (delta: -111.6MB). Peak memory consumption was 242.5MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,111 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB.
[2023-08-24 05:38:24,111 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 655.91ms. Allocated memory is still 390.1MB. Free memory was 362.8MB in the beginning and 309.1MB in the end (delta: 53.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,111 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.42ms. Allocated memory is still 390.1MB. Free memory was 309.1MB in the beginning and 306.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,112 INFO  L158              Benchmark]: Boogie Preprocessor took 30.15ms. Allocated memory is still 390.1MB. Free memory was 305.5MB in the beginning and 303.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,112 INFO  L158              Benchmark]: RCFGBuilder took 499.76ms. Allocated memory was 390.1MB in the beginning and 572.5MB in the end (delta: 182.5MB). Free memory was 302.8MB in the beginning and 543.4MB in the end (delta: -240.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,112 INFO  L158              Benchmark]: TraceAbstraction took 11823.03ms. Allocated memory was 572.5MB in the beginning and 742.4MB in the end (delta: 169.9MB). Free memory was 542.3MB in the beginning and 474.5MB in the end (delta: 67.8MB). Peak memory consumption was 238.7MB. Max. memory is 16.0GB.
[2023-08-24 05:38:24,114 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory was 368.0MB in the beginning and 367.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB.
 * CACSL2BoogieTranslator took 655.91ms. Allocated memory is still 390.1MB. Free memory was 362.8MB in the beginning and 309.1MB in the end (delta: 53.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.0GB.
 * Boogie Procedure Inliner took 42.42ms. Allocated memory is still 390.1MB. Free memory was 309.1MB in the beginning and 306.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
 * Boogie Preprocessor took 30.15ms. Allocated memory is still 390.1MB. Free memory was 305.5MB in the beginning and 303.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
 * RCFGBuilder took 499.76ms. Allocated memory was 390.1MB in the beginning and 572.5MB in the end (delta: 182.5MB). Free memory was 302.8MB in the beginning and 543.4MB in the end (delta: -240.6MB). Peak memory consumption was 28.9MB. Max. memory is 16.0GB.
 * TraceAbstraction took 11823.03ms. Allocated memory was 572.5MB in the beginning and 742.4MB in the end (delta: 169.9MB). Free memory was 542.3MB in the beginning and 474.5MB in the end (delta: 67.8MB). Peak memory consumption was 238.7MB. Max. memory is 16.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResultAtLocation [Line: 237]: Unsoundness Warning
    unspecified type, defaulting to int C: short [237]
  - GenericResultAtLocation [Line: 237]: Unsoundness Warning
    unspecified type, defaulting to int C: short [237]
  - GenericResultAtLocation [Line: 729]: Unsoundness Warning
    unspecified type, defaulting to int C: unsigned short [729]
  - GenericResultAtLocation [Line: 1709]: Unsoundness Warning
    unspecified type, defaulting to int C: unsigned long [1709]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 10.0s, 165 PlacesBefore, 36 PlacesAfterwards, 165 TransitionsBefore, 32 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 8 FixpointIterations, 98 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 176 TotalNumberOfCompositions, 5993 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2668, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1492, independent: 1448, independent conditional: 0, independent unconditional: 1448, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2668, independent: 995, independent conditional: 0, independent unconditional: 995, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1492, unknown conditional: 0, unknown unconditional: 1492] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 1693]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L1694]               0  pthread_t t1,t2;
[L1746]  CALL, EXPR   0  my_drv_init()
[L1740]               0  return 0;
[L1746]  RET, EXPR    0  my_drv_init()
[L1746]               0  int ret = my_drv_init();
[L1747]  COND TRUE    0  ret==0
[L1748]               0  int probe_ret;
[L1749]               0  struct my_data data;
[L1750]  CALL, EXPR   0  my_drv_probe(&data)
[L1717]               0  struct device *d = &data->dev;
[L1719]               0  data->shared.a = 0
[L1720]               0  data->shared.b = 0
[L1721]  EXPR         0  data->shared.a
[L1721]  CALL         0  ldv_assert(data->shared.a==0)
[L1693]  COND FALSE   0  !(!expression)
[L1721]  RET          0  ldv_assert(data->shared.a==0)
[L1722]  EXPR         0  data->shared.b
[L1722]  CALL         0  ldv_assert(data->shared.b==0)
[L1693]  COND FALSE   0  !(!expression)
[L1722]  RET          0  ldv_assert(data->shared.b==0)
[L1723]               0  int res = __VERIFIER_nondet_int();
[L1724]  COND FALSE   0  !(\read(res))
[L1726]  FCALL, FORK  0  pthread_create(&t1, ((void *)0), my_callback, (void *)d)
         VAL             [arg={12:24}, d={12:24}, data={12:0}, data={12:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-1, res=0, t1={3:0}, t2={4:0}]
[L1707]               1  struct device *dev = (struct device*)arg;
[L1708]               1  struct my_data *data;
[L1709]               1  const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
[L1709]               1  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
[L1709]               1  data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );})
[L1727]  FCALL, FORK  0  pthread_create(&t2, ((void *)0), my_callback, (void *)d)
         VAL             [__mptr={12:28}, arg={12:24}, arg={12:24}, d={12:24}, data={12:0}, data={12:0}, data={12:4}, dev={12:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=0, res=0, t1={3:0}, t2={4:0}]
[L1707]               2  struct device *dev = (struct device*)arg;
[L1708]               2  struct my_data *data;
[L1709]               2  const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
[L1709]               2  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
[L1709]               2  data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );})
[L1711]               2  data->shared.a = 1
         VAL             [__mptr={12:20}, arg={12:24}, arg={12:24}, data={12:-4}, dev={12:24}, t1={3:0}, t2={4:0}]
[L1712]  EXPR         2  data->shared.b
         VAL             [__mptr={12:20}, arg={12:24}, arg={12:24}, data->shared.b=0, data={12:-4}, dev={12:24}, t1={3:0}, t2={4:0}]
[L1712]               2  data->shared.b = data->shared.b + 1
[L1711]               1  data->shared.a = 1
         VAL             [__mptr={12:20}, arg={12:24}, arg={12:24}, data={12:-4}, dev={12:24}, t1={3:0}, t2={4:0}]
[L1712]  EXPR         1  data->shared.b
         VAL             [__mptr={12:20}, arg={12:24}, arg={12:24}, data->shared.b=7, data={12:-4}, dev={12:24}, t1={3:0}, t2={4:0}]
[L1712]               1  data->shared.b = data->shared.b + 1
[L1714]               1  return 0;
[L1714]               2  return 0;
[L1728]               0  return 0;
[L1750]  RET, EXPR    0  my_drv_probe(&data)
[L1750]               0  probe_ret = my_drv_probe(&data)
         VAL             [\result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:0}, data={12:4}, dev={12:24}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}]
[L1751]  COND TRUE    0  probe_ret==0
[L1752]  CALL         0  my_drv_disconnect(&data)
[L1734]               0  void *status;
[L1735]               0  \read(t1)
         VAL             [\read(t1)=-1, \result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:0}, data={12:0}, data={12:4}, dev={12:24}, status={11:0}, t1={3:0}, t2={4:0}]
[L1735]  FCALL, JOIN  1  pthread_join(t1, &status)
         VAL             [\read(t1)=-1, \result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:0}, data={12:0}, data={12:4}, dev={12:24}, pthread_join(t1, &status)={0:0}, status={11:0}, t1={3:0}, t2={4:0}]
[L1736]               0  \read(t2)
         VAL             [\read(t2)=0, \result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:0}, data={12:0}, data={12:4}, dev={12:24}, status={11:0}, t1={3:0}, t2={4:0}]
[L1736]  FCALL, JOIN  2  pthread_join(t2, &status)
         VAL             [\read(t2)=0, \result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:0}, data={12:0}, data={12:4}, dev={12:24}, pthread_join(t2, &status)={0:0}, status={11:0}, t1={3:0}, t2={4:0}]
[L1752]  RET          0  my_drv_disconnect(&data)
[L1753]  EXPR         0  data.shared.a
[L1753]  CALL         0  ldv_assert(data.shared.a==1)
[L1693]  COND FALSE   0  !(!expression)
[L1753]  RET          0  ldv_assert(data.shared.a==1)
[L1754]  EXPR         0  data.shared.b
[L1754]  CALL         0  ldv_assert(data.shared.b==2)
[L1693]  COND TRUE    0  !expression
[L1693]               0  reach_error()
         VAL             [\old(expression)=0, \result={0:0}, __mptr={12:20}, arg={12:24}, arg={12:24}, data={12:4}, dev={12:24}, expression=0, t1={3:0}, t2={4:0}]

  - UnprovableResult [Line: 1693]: 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: 1693]: 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: 1693]: 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: 1693]: 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: 1693]: 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: 1727]: 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: 1726]: 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, 189 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.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 7 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=3, InterpolantAutomatonStates: 11, 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.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-08-24 05:38:24,131 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...