/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_neg.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:28:24,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:28:24,406 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-26 12:28:24,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:28:24,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:28:24,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:28:24,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:28:24,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:28:24,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:28:24,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:28:24,440 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:28:24,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:28:24,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:28:24,444 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:28:24,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:28:24,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:28:24,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:28:24,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:28:24,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:28:24,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:28:24,446 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:28:24,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:28:24,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:28:24,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:28:24,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:28:24,447 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:28:24,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:28:24,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:24,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:28:24,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:28:24,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:28:24,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:28:24,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:28:24,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:28:24,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:28:24,450 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:28:24,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:28:24,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:28:24,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:28:24,720 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:28:24,724 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:28:24,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_neg.i [2023-08-26 12:28:25,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:28:25,905 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:28:25,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_neg.i [2023-08-26 12:28:25,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560d88813/87ec10132f6549179346497e6a5c7273/FLAG9d09ae4c2 [2023-08-26 12:28:25,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560d88813/87ec10132f6549179346497e6a5c7273 [2023-08-26 12:28:25,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:28:25,930 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:28:25,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:25,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:28:25,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:28:25,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:25" (1/1) ... [2023-08-26 12:28:25,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30340a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:25, skipping insertion in model container [2023-08-26 12:28:25,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:25" (1/1) ... [2023-08-26 12:28:25,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:28:26,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:26,362 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:28:26,383 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [231] [2023-08-26 12:28:26,384 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-26 12:28:26,388 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [730] [2023-08-26 12:28:26,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:26,467 WARN L669 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:28:26,472 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:28:26,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26 WrapperNode [2023-08-26 12:28:26,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:26,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:26,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:28:26,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:28:26,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,529 INFO L138 Inliner]: procedures = 354, calls = 39, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2023-08-26 12:28:26,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:26,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:28:26,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:28:26,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:28:26,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:28:26,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:28:26,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:28:26,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:28:26,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (1/1) ... [2023-08-26 12:28:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:26,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:28:26,605 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-26 12:28:26,627 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-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-08-26 12:28:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-08-26 12:28:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:28:26,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:28:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 12:28:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:28:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:28:26,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:28:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:28:26,641 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:28:26,891 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:28:26,892 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:28:27,004 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:28:27,013 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:28:27,013 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:28:27,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:27 BoogieIcfgContainer [2023-08-26 12:28:27,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:28:27,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:28:27,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:28:27,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:28:27,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:28:25" (1/3) ... [2023-08-26 12:28:27,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d09a77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:27, skipping insertion in model container [2023-08-26 12:28:27,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:26" (2/3) ... [2023-08-26 12:28:27,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d09a77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:27, skipping insertion in model container [2023-08-26 12:28:27,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:27" (3/3) ... [2023-08-26 12:28:27,020 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_neg.i [2023-08-26 12:28:27,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:28:27,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 12:28:27,031 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:28:27,078 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 12:28:27,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:27,149 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2023-08-26 12:28:27,149 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:28:27,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 98 events. 2/98 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-08-26 12:28:27,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:27,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:27,160 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:28:27,175 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:27,181 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:27,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:27,206 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-08-26 12:28:27,206 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:28:27,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 89 events. 2/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-08-26 12:28:27,208 INFO L119 LiptonReduction]: Number of co-enabled transitions 1196 [2023-08-26 12:28:30,292 INFO L134 LiptonReduction]: Checked pairs total: 3464 [2023-08-26 12:28:30,292 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-26 12:28:30,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:28:30,305 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;@700d2939, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:28:30,305 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:28:30,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:28:30,307 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:28:30,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:30,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:28:30,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:30,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 363, now seen corresponding path program 1 times [2023-08-26 12:28:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794153661] [2023-08-26 12:28:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,485 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-26 12:28:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794153661] [2023-08-26 12:28:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794153661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:28:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87969333] [2023-08-26 12:28:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:28:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:28:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:28:30,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 189 [2023-08-26 12:28:30,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 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-26 12:28:30,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 189 [2023-08-26 12:28:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:30,660 INFO L124 PetriNetUnfolderBase]: 287/533 cut-off events. [2023-08-26 12:28:30,660 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 12:28:30,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 533 events. 287/533 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2307 event pairs, 287 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 945. Up to 509 conditions per place. [2023-08-26 12:28:30,664 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-26 12:28:30,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 109 flow [2023-08-26 12:28:30,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:28:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:28:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2023-08-26 12:28:30,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5661375661375662 [2023-08-26 12:28:30,673 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 214 transitions. [2023-08-26 12:28:30,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 214 transitions. [2023-08-26 12:28:30,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:30,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 214 transitions. [2023-08-26 12:28:30,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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-26 12:28:30,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-26 12:28:30,680 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-26 12:28:30,681 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 71 flow. Second operand 2 states and 214 transitions. [2023-08-26 12:28:30,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 109 flow [2023-08-26 12:28:30,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:28:30,683 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 56 flow [2023-08-26 12:28:30,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-26 12:28:30,686 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-26 12:28:30,686 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 56 flow [2023-08-26 12:28:30,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 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-26 12:28:30,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:30,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:28:30,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:30,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 354708, now seen corresponding path program 1 times [2023-08-26 12:28:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762234556] [2023-08-26 12:28:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,826 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-26 12:28:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762234556] [2023-08-26 12:28:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762234556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169309613] [2023-08-26 12:28:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:30,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:30,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 189 [2023-08-26 12:28:30,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-26 12:28:30,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 189 [2023-08-26 12:28:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:30,880 INFO L124 PetriNetUnfolderBase]: 276/508 cut-off events. [2023-08-26 12:28:30,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:30,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 508 events. 276/508 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2176 event pairs, 276 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1005. Up to 484 conditions per place. [2023-08-26 12:28:30,885 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 21 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-08-26 12:28:30,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 96 flow [2023-08-26 12:28:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-08-26 12:28:30,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2023-08-26 12:28:30,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-08-26 12:28:30,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-08-26 12:28:30,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:30,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-08-26 12:28:30,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-26 12:28:30,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:30,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:30,895 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 56 flow. Second operand 3 states and 246 transitions. [2023-08-26 12:28:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 96 flow [2023-08-26 12:28:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:28:30,896 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 54 flow [2023-08-26 12:28:30,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-26 12:28:30,899 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-26 12:28:30,899 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 54 flow [2023-08-26 12:28:30,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-26 12:28:30,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:30,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:28:30,900 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:30,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash 354706, now seen corresponding path program 1 times [2023-08-26 12:28:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052498215] [2023-08-26 12:28:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,964 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-26 12:28:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052498215] [2023-08-26 12:28:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052498215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364683376] [2023-08-26 12:28:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:30,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 189 [2023-08-26 12:28:30,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-26 12:28:30,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 189 [2023-08-26 12:28:30,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,008 INFO L124 PetriNetUnfolderBase]: 265/483 cut-off events. [2023-08-26 12:28:31,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 483 events. 265/483 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2055 event pairs, 265 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 957. Up to 460 conditions per place. [2023-08-26 12:28:31,010 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 19 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-08-26 12:28:31,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 90 flow [2023-08-26 12:28:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-26 12:28:31,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2023-08-26 12:28:31,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-26 12:28:31,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-26 12:28:31,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-26 12:28:31,012 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-26 12:28:31,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,014 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,014 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 238 transitions. [2023-08-26 12:28:31,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 90 flow [2023-08-26 12:28:31,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 89 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,015 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 51 flow [2023-08-26 12:28:31,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-26 12:28:31,016 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:31,018 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 51 flow [2023-08-26 12:28:31,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-26 12:28:31,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:31,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:28:31,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash 340881123, now seen corresponding path program 1 times [2023-08-26 12:28:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708355227] [2023-08-26 12:28:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,127 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-26 12:28:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708355227] [2023-08-26 12:28:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708355227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820519342] [2023-08-26 12:28:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:28:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:28:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:28:31,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2023-08-26 12:28:31,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-26 12:28:31,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2023-08-26 12:28:31,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,167 INFO L124 PetriNetUnfolderBase]: 194/365 cut-off events. [2023-08-26 12:28:31,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 365 events. 194/365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1464 event pairs, 194 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 727. Up to 347 conditions per place. [2023-08-26 12:28:31,168 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 18 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-26 12:28:31,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 87 flow [2023-08-26 12:28:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-08-26 12:28:31,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.400352733686067 [2023-08-26 12:28:31,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-08-26 12:28:31,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-08-26 12:28:31,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-08-26 12:28:31,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-26 12:28:31,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,172 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 51 flow. Second operand 3 states and 227 transitions. [2023-08-26 12:28:31,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 87 flow [2023-08-26 12:28:31,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,172 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 50 flow [2023-08-26 12:28:31,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-26 12:28:31,173 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:31,173 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 50 flow [2023-08-26 12:28:31,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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-26 12:28:31,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:31,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:28:31,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 340881124, now seen corresponding path program 1 times [2023-08-26 12:28:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930755960] [2023-08-26 12:28:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,291 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-26 12:28:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930755960] [2023-08-26 12:28:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930755960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296424862] [2023-08-26 12:28:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:28:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:28:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:28:31,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 189 [2023-08-26 12:28:31,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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-26 12:28:31,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 189 [2023-08-26 12:28:31,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,328 INFO L124 PetriNetUnfolderBase]: 123/247 cut-off events. [2023-08-26 12:28:31,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 247 events. 123/247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 897 event pairs, 123 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 497. Up to 234 conditions per place. [2023-08-26 12:28:31,329 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 13 selfloop transitions, 1 changer transitions 5/20 dead transitions. [2023-08-26 12:28:31,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 84 flow [2023-08-26 12:28:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-08-26 12:28:31,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4038800705467372 [2023-08-26 12:28:31,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-08-26 12:28:31,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-08-26 12:28:31,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-08-26 12:28:31,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-26 12:28:31,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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-26 12:28:31,332 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 50 flow. Second operand 3 states and 229 transitions. [2023-08-26 12:28:31,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 84 flow [2023-08-26 12:28:31,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 83 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,333 INFO L231 Difference]: Finished difference. Result has 30 places, 15 transitions, 39 flow [2023-08-26 12:28:31,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=39, PETRI_PLACES=30, PETRI_TRANSITIONS=15} [2023-08-26 12:28:31,334 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:31,334 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 15 transitions, 39 flow [2023-08-26 12:28:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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-26 12:28:31,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:28:31,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1977380701, now seen corresponding path program 1 times [2023-08-26 12:28:31,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825934604] [2023-08-26 12:28:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:31,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:28:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:31,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:28:31,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:28:31,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:28:31,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-08-26 12:28:31,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:28:31,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:28:31,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:28:31,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:28:31,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:28:31,391 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,395 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:28:31,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:28:31,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:28:31 BasicIcfg [2023-08-26 12:28:31,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:28:31,421 INFO L158 Benchmark]: Toolchain (without parser) took 5491.23ms. Allocated memory was 394.3MB in the beginning and 536.9MB in the end (delta: 142.6MB). Free memory was 368.6MB in the beginning and 296.5MB in the end (delta: 72.1MB). Peak memory consumption was 216.6MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,422 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 394.3MB. Free memory is still 371.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:28:31,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.85ms. Allocated memory is still 394.3MB. Free memory was 368.6MB in the beginning and 330.0MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.17ms. Allocated memory is still 394.3MB. Free memory was 330.0MB in the beginning and 327.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,423 INFO L158 Benchmark]: Boogie Preprocessor took 47.01ms. Allocated memory is still 394.3MB. Free memory was 327.9MB in the beginning and 325.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,424 INFO L158 Benchmark]: RCFGBuilder took 436.80ms. Allocated memory is still 394.3MB. Free memory was 325.4MB in the beginning and 303.5MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,424 INFO L158 Benchmark]: TraceAbstraction took 4404.40ms. Allocated memory was 394.3MB in the beginning and 536.9MB in the end (delta: 142.6MB). Free memory was 302.7MB in the beginning and 296.5MB in the end (delta: 6.2MB). Peak memory consumption was 151.5MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,431 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.12ms. Allocated memory is still 394.3MB. Free memory is still 371.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 541.85ms. Allocated memory is still 394.3MB. Free memory was 368.6MB in the beginning and 330.0MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.17ms. Allocated memory is still 394.3MB. Free memory was 330.0MB in the beginning and 327.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.01ms. Allocated memory is still 394.3MB. Free memory was 327.9MB in the beginning and 325.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 436.80ms. Allocated memory is still 394.3MB. Free memory was 325.4MB in the beginning and 303.5MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 4404.40ms. Allocated memory was 394.3MB in the beginning and 536.9MB in the end (delta: 142.6MB). Free memory was 302.7MB in the beginning and 296.5MB in the end (delta: 6.2MB). Peak memory consumption was 151.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 231]: Unsoundness Warning unspecified type, defaulting to int C: short [231] - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 730]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [730] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 94 PlacesBefore, 36 PlacesAfterwards, 89 TransitionsBefore, 31 TransitionsAfterwards, 1196 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 3464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1661, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 642, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1661, independent: 886, independent conditional: 0, independent unconditional: 886, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 642, unknown conditional: 0, unknown unconditional: 642] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1151:1150}, argv={1151:1150}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-2, ptr={0:0}, t1={5:0}, t2={6:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1151:1150}, argv={1151:1150}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=-1, ptr={0:0}, t1={5:0}, t2={6:0}] [L1365] CALL 2 __VERIFIER_assert(!(g == 0)) [L19] COND TRUE 2 !(cond) [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "13-privatized_67-pthread_cond_wait_unknown_1_neg.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [cond={4:0}, g=0, mut={3:0}, ptr={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1377]: 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: 1375]: 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, 132 locations, 12 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: 4.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-26 12:28:31,446 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...