/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/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:31:32,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:31:32,653 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:31:32,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:31:32,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:31:32,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:31:32,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:31:32,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:31:32,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:31:32,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:31:32,695 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:31:32,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:31:32,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:31:32,697 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:31:32,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:31:32,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:31:32,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:31:32,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:31:32,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:31:32,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:31:32,698 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:31:32,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:31:32,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:31:32,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:31:32,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:31:32,700 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:31:32,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:31:32,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:32,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:31:32,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:31:32,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:31:32,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:31:32,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:31:32,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:31:32,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:31:32,703 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:31:32,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:31:33,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:31:33,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:31:33,013 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:31:33,016 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:31:33,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-24 05:31:34,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:31:34,586 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:31:34,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-24 05:31:34,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d20c0667/3ba514d532df41e8aad27a20da624332/FLAGff94ac668 [2023-08-24 05:31:34,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d20c0667/3ba514d532df41e8aad27a20da624332 [2023-08-24 05:31:34,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:31:34,627 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:31:34,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:34,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:31:34,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:31:34,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:34" (1/1) ... [2023-08-24 05:31:34,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ac4ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:34, skipping insertion in model container [2023-08-24 05:31:34,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:34" (1/1) ... [2023-08-24 05:31:34,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:31:34,846 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-24 05:31:35,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:35,051 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:31:35,061 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2023-08-24 05:31:35,067 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:35,073 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:35,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:35,138 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:35,138 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:35,143 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:31:35,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35 WrapperNode [2023-08-24 05:31:35,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:35,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:35,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:31:35,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:31:35,149 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:31:35" (1/1) ... [2023-08-24 05:31:35,162 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:31:35" (1/1) ... [2023-08-24 05:31:35,186 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2023-08-24 05:31:35,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:35,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:31:35,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:31:35,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:31:35,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:31:35,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:31:35,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:31:35,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:31:35,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (1/1) ... [2023-08-24 05:31:35,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:35,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:31:35,274 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:31:35,285 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:31:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:31:35,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:31:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:31:35,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:31:35,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:31:35,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:31:35,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:31:35,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:31:35,308 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:31:35,429 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:31:35,431 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:31:35,636 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:31:35,820 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:31:35,820 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:31:35,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:35 BoogieIcfgContainer [2023-08-24 05:31:35,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:31:35,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:31:35,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:31:35,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:31:35,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:31:34" (1/3) ... [2023-08-24 05:31:35,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c38f965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:35, skipping insertion in model container [2023-08-24 05:31:35,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:35" (2/3) ... [2023-08-24 05:31:35,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c38f965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:35, skipping insertion in model container [2023-08-24 05:31:35,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:35" (3/3) ... [2023-08-24 05:31:35,831 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2023-08-24 05:31:35,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:31:35,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:31:35,848 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:31:35,899 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:31:35,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-08-24 05:31:35,988 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-08-24 05:31:35,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:35,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:31:35,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-08-24 05:31:35,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:36,001 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:31:36,013 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:36,017 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:36,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:36,045 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-08-24 05:31:36,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:36,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:31:36,047 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-08-24 05:31:38,940 INFO L134 LiptonReduction]: Checked pairs total: 2524 [2023-08-24 05:31:38,941 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-24 05:31:38,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:31:38,957 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;@7c79eb71, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:31:38,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:31:38,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:31:38,959 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-24 05:31:38,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:38,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:38,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:31:38,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:38,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash 396690, now seen corresponding path program 1 times [2023-08-24 05:31:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67583635] [2023-08-24 05:31:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:38,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:39,348 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:31:39,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:39,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67583635] [2023-08-24 05:31:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67583635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:31:39,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017468209] [2023-08-24 05:31:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:39,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:39,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 165 [2023-08-24 05:31:39,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:31:39,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:39,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 165 [2023-08-24 05:31:39,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:39,520 INFO L124 PetriNetUnfolderBase]: 142/278 cut-off events. [2023-08-24 05:31:39,520 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 05:31:39,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 278 events. 142/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1163 event pairs, 16 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 533. Up to 208 conditions per place. [2023-08-24 05:31:39,525 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 21 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-08-24 05:31:39,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 111 flow [2023-08-24 05:31:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-08-24 05:31:39,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2023-08-24 05:31:39,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-08-24 05:31:39,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-08-24 05:31:39,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:39,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-08-24 05:31:39,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:31:39,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:39,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:39,551 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 253 transitions. [2023-08-24 05:31:39,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 111 flow [2023-08-24 05:31:39,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:39,554 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2023-08-24 05:31:39,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-08-24 05:31:39,559 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-08-24 05:31:39,559 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2023-08-24 05:31:39,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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:31:39,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:39,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:39,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:31:39,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:39,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1322633842, now seen corresponding path program 1 times [2023-08-24 05:31:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725255926] [2023-08-24 05:31:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:39,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:39,687 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:31:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725255926] [2023-08-24 05:31:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725255926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:31:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630738342] [2023-08-24 05:31:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:39,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:39,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:39,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:39,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 165 [2023-08-24 05:31:39,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:31:39,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:39,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 165 [2023-08-24 05:31:39,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:39,760 INFO L124 PetriNetUnfolderBase]: 140/249 cut-off events. [2023-08-24 05:31:39,760 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 05:31:39,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 249 events. 140/249 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 794 event pairs, 56 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 525. Up to 235 conditions per place. [2023-08-24 05:31:39,762 INFO L140 encePairwiseOnDemand]: 161/165 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2023-08-24 05:31:39,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 22 transitions, 100 flow [2023-08-24 05:31:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2023-08-24 05:31:39,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48282828282828283 [2023-08-24 05:31:39,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2023-08-24 05:31:39,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2023-08-24 05:31:39,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:39,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2023-08-24 05:31:39,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:31:39,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:39,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:39,768 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 239 transitions. [2023-08-24 05:31:39,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 22 transitions, 100 flow [2023-08-24 05:31:39,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:39,769 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2023-08-24 05:31:39,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-24 05:31:39,770 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-08-24 05:31:39,770 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2023-08-24 05:31:39,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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:31:39,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:39,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:31:39,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:39,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1948025167, now seen corresponding path program 1 times [2023-08-24 05:31:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732665371] [2023-08-24 05:31:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:39,989 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:31:39,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:39,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732665371] [2023-08-24 05:31:39,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732665371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:39,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:31:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555215601] [2023-08-24 05:31:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:39,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:31:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:31:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:31:39,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2023-08-24 05:31:39,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 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:31:39,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:39,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2023-08-24 05:31:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:40,098 INFO L124 PetriNetUnfolderBase]: 67/152 cut-off events. [2023-08-24 05:31:40,098 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-24 05:31:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 152 events. 67/152 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 536 event pairs, 13 based on Foata normal form. 24/175 useless extension candidates. Maximal degree in co-relation 335. Up to 68 conditions per place. [2023-08-24 05:31:40,100 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 26 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2023-08-24 05:31:40,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 42 transitions, 194 flow [2023-08-24 05:31:40,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:31:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:31:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2023-08-24 05:31:40,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2023-08-24 05:31:40,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 390 transitions. [2023-08-24 05:31:40,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 390 transitions. [2023-08-24 05:31:40,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:40,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 390 transitions. [2023-08-24 05:31:40,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 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:31:40,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 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:31:40,113 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 165.0) internal successors, (990), 6 states have internal predecessors, (990), 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:31:40,113 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 5 states and 390 transitions. [2023-08-24 05:31:40,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 42 transitions, 194 flow [2023-08-24 05:31:40,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:31:40,115 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 87 flow [2023-08-24 05:31:40,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-24 05:31:40,117 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2023-08-24 05:31:40,120 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 87 flow [2023-08-24 05:31:40,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 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:31:40,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:40,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:40,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:31:40,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:40,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1591499701, now seen corresponding path program 1 times [2023-08-24 05:31:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:40,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116786195] [2023-08-24 05:31:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:40,253 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:31:40,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116786195] [2023-08-24 05:31:40,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116786195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:40,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:40,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:31:40,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335826797] [2023-08-24 05:31:40,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:40,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:40,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:40,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:40,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:40,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 165 [2023-08-24 05:31:40,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:31:40,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:40,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 165 [2023-08-24 05:31:40,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:40,330 INFO L124 PetriNetUnfolderBase]: 96/215 cut-off events. [2023-08-24 05:31:40,331 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-08-24 05:31:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 215 events. 96/215 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 830 event pairs, 24 based on Foata normal form. 7/222 useless extension candidates. Maximal degree in co-relation 628. Up to 121 conditions per place. [2023-08-24 05:31:40,333 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 21 selfloop transitions, 5 changer transitions 7/33 dead transitions. [2023-08-24 05:31:40,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 203 flow [2023-08-24 05:31:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-24 05:31:40,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808080808080808 [2023-08-24 05:31:40,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-24 05:31:40,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-24 05:31:40,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:40,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-24 05:31:40,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:31:40,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:40,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:31:40,338 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 87 flow. Second operand 3 states and 238 transitions. [2023-08-24 05:31:40,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 203 flow [2023-08-24 05:31:40,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 203 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 05:31:40,340 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 96 flow [2023-08-24 05:31:40,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-24 05:31:40,341 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2023-08-24 05:31:40,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 96 flow [2023-08-24 05:31:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:31:40,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:40,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:40,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:31:40,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:40,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 50165391, now seen corresponding path program 1 times [2023-08-24 05:31:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711197077] [2023-08-24 05:31:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:40,625 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:31:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711197077] [2023-08-24 05:31:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711197077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642915017] [2023-08-24 05:31:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:40,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:31:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:31:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:31:40,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2023-08-24 05:31:40,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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:31:40,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:40,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2023-08-24 05:31:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:40,704 INFO L124 PetriNetUnfolderBase]: 35/98 cut-off events. [2023-08-24 05:31:40,704 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-24 05:31:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 98 events. 35/98 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 11 based on Foata normal form. 14/111 useless extension candidates. Maximal degree in co-relation 294. Up to 38 conditions per place. [2023-08-24 05:31:40,705 INFO L140 encePairwiseOnDemand]: 160/165 looper letters, 20 selfloop transitions, 5 changer transitions 10/37 dead transitions. [2023-08-24 05:31:40,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 230 flow [2023-08-24 05:31:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:31:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:31:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2023-08-24 05:31:40,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575757575757576 [2023-08-24 05:31:40,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2023-08-24 05:31:40,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2023-08-24 05:31:40,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:40,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2023-08-24 05:31:40,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:31:40,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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:31:40,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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:31:40,711 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 96 flow. Second operand 6 states and 453 transitions. [2023-08-24 05:31:40,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 230 flow [2023-08-24 05:31:40,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 211 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:40,713 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 103 flow [2023-08-24 05:31:40,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2023-08-24 05:31:40,714 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2023-08-24 05:31:40,714 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 103 flow [2023-08-24 05:31:40,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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:31:40,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:40,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:40,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:31:40,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:40,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1936441024, now seen corresponding path program 1 times [2023-08-24 05:31:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130418368] [2023-08-24 05:31:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:41,061 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:31:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130418368] [2023-08-24 05:31:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130418368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268197523] [2023-08-24 05:31:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:41,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:31:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:31:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:31:41,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 165 [2023-08-24 05:31:41,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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:31:41,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:41,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 165 [2023-08-24 05:31:41,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:41,168 INFO L124 PetriNetUnfolderBase]: 30/102 cut-off events. [2023-08-24 05:31:41,169 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-08-24 05:31:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 102 events. 30/102 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 371 event pairs, 3 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 334. Up to 45 conditions per place. [2023-08-24 05:31:41,169 INFO L140 encePairwiseOnDemand]: 159/165 looper letters, 18 selfloop transitions, 3 changer transitions 24/47 dead transitions. [2023-08-24 05:31:41,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 341 flow [2023-08-24 05:31:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:31:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:31:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2023-08-24 05:31:41,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616161616161616 [2023-08-24 05:31:41,171 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 457 transitions. [2023-08-24 05:31:41,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 457 transitions. [2023-08-24 05:31:41,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:41,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 457 transitions. [2023-08-24 05:31:41,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.16666666666667) internal successors, (457), 6 states have internal predecessors, (457), 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:31:41,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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:31:41,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 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:31:41,175 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 103 flow. Second operand 6 states and 457 transitions. [2023-08-24 05:31:41,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 341 flow [2023-08-24 05:31:41,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 286 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-24 05:31:41,177 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 105 flow [2023-08-24 05:31:41,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-08-24 05:31:41,178 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2023-08-24 05:31:41,178 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 105 flow [2023-08-24 05:31:41,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 5 states have internal predecessors, (364), 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:31:41,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:41,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:41,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:31:41,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:41,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:41,179 INFO L85 PathProgramCache]: Analyzing trace with hash -633762026, now seen corresponding path program 2 times [2023-08-24 05:31:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677764019] [2023-08-24 05:31:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:31:41,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:31:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:31:41,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:31:41,265 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:31:41,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:31:41,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 05:31:41,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:31:41,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:31:41,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 05:31:41,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:31:41,268 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-24 05:31:41,273 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:31:41,273 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:31:41,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:31:41 BasicIcfg [2023-08-24 05:31:41,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:31:41,322 INFO L158 Benchmark]: Toolchain (without parser) took 6695.06ms. Allocated memory was 383.8MB in the beginning and 505.4MB in the end (delta: 121.6MB). Free memory was 358.7MB in the beginning and 252.4MB in the end (delta: 106.3MB). Peak memory consumption was 227.4MB. Max. memory is 16.0GB. [2023-08-24 05:31:41,322 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 383.8MB. Free memory is still 360.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:31:41,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 383.8MB. Free memory was 358.7MB in the beginning and 336.1MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-24 05:31:41,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.53ms. Allocated memory is still 383.8MB. Free memory was 336.1MB in the beginning and 333.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:31:41,323 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 383.8MB. Free memory was 333.5MB in the beginning and 331.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:31:41,324 INFO L158 Benchmark]: RCFGBuilder took 578.71ms. Allocated memory is still 383.8MB. Free memory was 331.9MB in the beginning and 350.9MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 05:31:41,324 INFO L158 Benchmark]: TraceAbstraction took 5497.02ms. Allocated memory was 383.8MB in the beginning and 505.4MB in the end (delta: 121.6MB). Free memory was 349.8MB in the beginning and 252.4MB in the end (delta: 97.4MB). Peak memory consumption was 219.0MB. Max. memory is 16.0GB. [2023-08-24 05:31:41,328 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.14ms. Allocated memory is still 383.8MB. Free memory is still 360.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 513.88ms. Allocated memory is still 383.8MB. Free memory was 358.7MB in the beginning and 336.1MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.53ms. Allocated memory is still 383.8MB. Free memory was 336.1MB in the beginning and 333.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 383.8MB. Free memory was 333.5MB in the beginning and 331.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 578.71ms. Allocated memory is still 383.8MB. Free memory was 331.9MB in the beginning and 350.9MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 5497.02ms. Allocated memory was 383.8MB in the beginning and 505.4MB in the end (delta: 121.6MB). Free memory was 349.8MB in the beginning and 252.4MB in the end (delta: 97.4MB). Peak memory consumption was 219.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 90 PlacesBefore, 24 PlacesAfterwards, 85 TransitionsBefore, 18 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 2524 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1173, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 582, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1173, independent: 498, independent conditional: 0, independent unconditional: 498, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 582, unknown conditional: 0, unknown unconditional: 582] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L805] 0 pthread_t t1441; [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1441, ((void *)0), P0, ((void *)0))=-2, t1441={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1442, ((void *)0), P1, ((void *)0))=-1, t1441={5:0}, t1442={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441={5:0}, t1442={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=6, InterpolantAutomatonStates: 26, 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, 1.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 213 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-08-24 05:31:41,354 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...