/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_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:28:22,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:28:22,629 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:22,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:28:22,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:28:22,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:28:22,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:28:22,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:28:22,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:28:22,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:28:22,671 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:28:22,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:28:22,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:28:22,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:28:22,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:28:22,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:28:22,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:28:22,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:28:22,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:28:22,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:28:22,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:28:22,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:28:22,674 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:28:22,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:28:22,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:28:22,676 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:28:22,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:28:22,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:22,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:28:22,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:28:22,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:28:22,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:28:22,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:28:22,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:28:22,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:28:22,679 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:23,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:28:23,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:28:23,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:28:23,044 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:28:23,044 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:28:23,046 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_true.i [2023-08-26 12:28:24,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:28:24,586 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:28:24,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_true.i [2023-08-26 12:28:24,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77899df92/022984a2a8fa4f428e9c304e673a5096/FLAG6ff9f47be [2023-08-26 12:28:24,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77899df92/022984a2a8fa4f428e9c304e673a5096 [2023-08-26 12:28:24,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:28:24,628 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:28:24,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:24,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:28:24,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:28:24,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:24" (1/1) ... [2023-08-26 12:28:24,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad3ac81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:24, skipping insertion in model container [2023-08-26 12:28:24,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:24" (1/1) ... [2023-08-26 12:28:24,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:28:25,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:25,183 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:28:25,207 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [231] [2023-08-26 12:28:25,209 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-26 12:28:25,216 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [730] [2023-08-26 12:28:25,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:25,314 WARN L669 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:28:25,320 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:28:25,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:25 WrapperNode [2023-08-26 12:28:25,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:25,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:25,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:28:25,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:28:25,326 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:25" (1/1) ... [2023-08-26 12:28:25,345 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:25" (1/1) ... [2023-08-26 12:28:25,373 INFO L138 Inliner]: procedures = 354, calls = 39, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2023-08-26 12:28:25,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:25,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:28:25,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:28:25,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:28:25,380 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:25" (1/1) ... [2023-08-26 12:28:25,381 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:25" (1/1) ... [2023-08-26 12:28:25,388 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:25" (1/1) ... [2023-08-26 12:28:25,389 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:25" (1/1) ... [2023-08-26 12:28:25,401 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:25" (1/1) ... [2023-08-26 12:28:25,417 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:25" (1/1) ... [2023-08-26 12:28:25,421 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:25" (1/1) ... [2023-08-26 12:28:25,423 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:25" (1/1) ... [2023-08-26 12:28:25,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:28:25,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:28:25,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:28:25,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:28:25,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:25" (1/1) ... [2023-08-26 12:28:25,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:25,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:28:25,481 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:25,493 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:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-08-26 12:28:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-08-26 12:28:25,516 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-08-26 12:28:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-08-26 12:28:25,516 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-08-26 12:28:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:28:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:28:25,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:28:25,519 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:25,804 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:28:25,807 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:28:26,015 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:28:26,029 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:28:26,029 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:28:26,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:26 BoogieIcfgContainer [2023-08-26 12:28:26,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:28:26,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:28:26,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:28:26,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:28:26,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:28:24" (1/3) ... [2023-08-26 12:28:26,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4662dabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:26, skipping insertion in model container [2023-08-26 12:28:26,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:25" (2/3) ... [2023-08-26 12:28:26,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4662dabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:26, skipping insertion in model container [2023-08-26 12:28:26,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:26" (3/3) ... [2023-08-26 12:28:26,040 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_true.i [2023-08-26 12:28:26,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:28:26,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 12:28:26,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:28:26,117 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 12:28:26,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:26,203 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2023-08-26 12:28:26,203 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:28:26,208 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 6. Compared 100 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-26 12:28:26,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:26,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 185 flow [2023-08-26 12:28:26,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:28:26,227 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 185 flow [2023-08-26 12:28:26,230 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 185 flow [2023-08-26 12:28:26,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 185 flow [2023-08-26 12:28:26,261 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-08-26 12:28:26,261 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:28:26,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 88 events. 2/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2023-08-26 12:28:26,263 INFO L119 LiptonReduction]: Number of co-enabled transitions 1182 [2023-08-26 12:28:29,928 INFO L134 LiptonReduction]: Checked pairs total: 3054 [2023-08-26 12:28:29,928 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-26 12:28:29,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:28:29,945 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;@7058b0f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:28:29,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:28:29,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:28:29,946 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:28:29,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:29,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:29,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:28:29,948 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:29,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash 365, now seen corresponding path program 1 times [2023-08-26 12:28:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227324802] [2023-08-26 12:28:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,166 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,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227324802] [2023-08-26 12:28:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227324802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:28:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081701221] [2023-08-26 12:28:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:28:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:28:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:28:30,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192 [2023-08-26 12:28:30,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 67 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,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192 [2023-08-26 12:28:30,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:30,318 INFO L124 PetriNetUnfolderBase]: 138/296 cut-off events. [2023-08-26 12:28:30,318 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 12:28:30,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 296 events. 138/296 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1263 event pairs, 138 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 536. Up to 261 conditions per place. [2023-08-26 12:28:30,322 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 12:28:30,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 23 transitions, 95 flow [2023-08-26 12:28:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:28:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:28:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 210 transitions. [2023-08-26 12:28:30,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2023-08-26 12:28:30,336 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 210 transitions. [2023-08-26 12:28:30,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 210 transitions. [2023-08-26 12:28:30,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:30,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 210 transitions. [2023-08-26 12:28:30,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 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,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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,345 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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,347 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 67 flow. Second operand 2 states and 210 transitions. [2023-08-26 12:28:30,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 23 transitions, 95 flow [2023-08-26 12:28:30,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:28:30,353 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 50 flow [2023-08-26 12:28:30,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2023-08-26 12:28:30,357 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -6 predicate places. [2023-08-26 12:28:30,357 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 50 flow [2023-08-26 12:28:30,358 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,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:30,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:28:30,358 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,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 357596, now seen corresponding path program 1 times [2023-08-26 12:28:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421661395] [2023-08-26 12:28:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,559 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,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421661395] [2023-08-26 12:28:30,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421661395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017966563] [2023-08-26 12:28:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:30,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 192 [2023-08-26 12:28:30,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 50 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,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 192 [2023-08-26 12:28:30,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:30,649 INFO L124 PetriNetUnfolderBase]: 130/276 cut-off events. [2023-08-26 12:28:30,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:30,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 276 events. 130/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1163 event pairs, 130 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 533. Up to 242 conditions per place. [2023-08-26 12:28:30,656 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-26 12:28:30,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 82 flow [2023-08-26 12:28:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-08-26 12:28:30,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201388888888889 [2023-08-26 12:28:30,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-08-26 12:28:30,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-08-26 12:28:30,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:30,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-08-26 12:28:30,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,673 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 50 flow. Second operand 3 states and 242 transitions. [2023-08-26 12:28:30,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 82 flow [2023-08-26 12:28:30,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:28:30,674 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 48 flow [2023-08-26 12:28:30,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=48, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-26 12:28:30,678 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -6 predicate places. [2023-08-26 12:28:30,678 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 48 flow [2023-08-26 12:28:30,678 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,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:30,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:28:30,681 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,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash 357595, now seen corresponding path program 1 times [2023-08-26 12:28:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029075653] [2023-08-26 12:28:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:30,805 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,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:30,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029075653] [2023-08-26 12:28:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029075653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:30,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:30,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305463720] [2023-08-26 12:28:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:30,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:30,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:30,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:30,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 192 [2023-08-26 12:28:30,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 48 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,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:30,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 192 [2023-08-26 12:28:30,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:30,865 INFO L124 PetriNetUnfolderBase]: 122/256 cut-off events. [2023-08-26 12:28:30,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:30,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 256 events. 122/256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1073 event pairs, 122 based on Foata normal form. 3/202 useless extension candidates. Maximal degree in co-relation 496. Up to 224 conditions per place. [2023-08-26 12:28:30,867 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 14 selfloop transitions, 1 changer transitions 1/19 dead transitions. [2023-08-26 12:28:30,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 76 flow [2023-08-26 12:28:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2023-08-26 12:28:30,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2023-08-26 12:28:30,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2023-08-26 12:28:30,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2023-08-26 12:28:30,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:30,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2023-08-26 12:28:30,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,873 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 48 flow. Second operand 3 states and 234 transitions. [2023-08-26 12:28:30,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 76 flow [2023-08-26 12:28:30,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 75 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:30,874 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 42 flow [2023-08-26 12:28:30,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-26 12:28:30,876 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -7 predicate places. [2023-08-26 12:28:30,878 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 42 flow [2023-08-26 12:28:30,879 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:30,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:30,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:28:30,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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:30,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 343658414, now seen corresponding path program 1 times [2023-08-26 12:28:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547325871] [2023-08-26 12:28:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,015 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,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547325871] [2023-08-26 12:28:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547325871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95592101] [2023-08-26 12:28:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:31,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 192 [2023-08-26 12:28:31,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 42 flow. Second operand has 3 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,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 192 [2023-08-26 12:28:31,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,051 INFO L124 PetriNetUnfolderBase]: 88/191 cut-off events. [2023-08-26 12:28:31,052 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 191 events. 88/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 729 event pairs, 88 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 374. Up to 166 conditions per place. [2023-08-26 12:28:31,053 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 13 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2023-08-26 12:28:31,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 17 transitions, 68 flow [2023-08-26 12:28:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-08-26 12:28:31,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2023-08-26 12:28:31,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 237 transitions. [2023-08-26 12:28:31,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 237 transitions. [2023-08-26 12:28:31,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 237 transitions. [2023-08-26 12:28:31,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,058 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 42 flow. Second operand 3 states and 237 transitions. [2023-08-26 12:28:31,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 17 transitions, 68 flow [2023-08-26 12:28:31,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 17 transitions, 67 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,058 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 41 flow [2023-08-26 12:28:31,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-26 12:28:31,059 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -8 predicate places. [2023-08-26 12:28:31,059 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 41 flow [2023-08-26 12:28:31,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:31,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:28:31,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash 343658412, now seen corresponding path program 1 times [2023-08-26 12:28:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222800209] [2023-08-26 12:28:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,151 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,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222800209] [2023-08-26 12:28:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222800209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248746848] [2023-08-26 12:28:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:28:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:28:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:28:31,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 192 [2023-08-26 12:28:31,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 41 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,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 192 [2023-08-26 12:28:31,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,189 INFO L124 PetriNetUnfolderBase]: 56/131 cut-off events. [2023-08-26 12:28:31,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 131 events. 56/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 452 event pairs, 56 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 262. Up to 113 conditions per place. [2023-08-26 12:28:31,190 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 10 selfloop transitions, 1 changer transitions 3/16 dead transitions. [2023-08-26 12:28:31,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 16 transitions, 65 flow [2023-08-26 12:28:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2023-08-26 12:28:31,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3836805555555556 [2023-08-26 12:28:31,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2023-08-26 12:28:31,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2023-08-26 12:28:31,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2023-08-26 12:28:31,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,196 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 41 flow. Second operand 3 states and 221 transitions. [2023-08-26 12:28:31,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 16 transitions, 65 flow [2023-08-26 12:28:31,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 64 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,196 INFO L231 Difference]: Finished difference. Result has 26 places, 13 transitions, 34 flow [2023-08-26 12:28:31,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=34, PETRI_PLACES=26, PETRI_TRANSITIONS=13} [2023-08-26 12:28:31,199 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -8 predicate places. [2023-08-26 12:28:31,199 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 13 transitions, 34 flow [2023-08-26 12:28:31,199 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,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:28:31,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash -493573777, now seen corresponding path program 1 times [2023-08-26 12:28:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994431682] [2023-08-26 12:28:31,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,276 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,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994431682] [2023-08-26 12:28:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994431682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810295261] [2023-08-26 12:28:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:31,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 192 [2023-08-26 12:28:31,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 13 transitions, 34 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 192 [2023-08-26 12:28:31,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,320 INFO L124 PetriNetUnfolderBase]: 47/110 cut-off events. [2023-08-26 12:28:31,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 110 events. 47/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 358 event pairs, 23 based on Foata normal form. 10/120 useless extension candidates. Maximal degree in co-relation 223. Up to 61 conditions per place. [2023-08-26 12:28:31,321 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 15 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2023-08-26 12:28:31,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 88 flow [2023-08-26 12:28:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-26 12:28:31,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2023-08-26 12:28:31,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-26 12:28:31,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-26 12:28:31,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-26 12:28:31,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,326 INFO L175 Difference]: Start difference. First operand has 26 places, 13 transitions, 34 flow. Second operand 3 states and 284 transitions. [2023-08-26 12:28:31,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 88 flow [2023-08-26 12:28:31,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 20 transitions, 87 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,327 INFO L231 Difference]: Finished difference. Result has 25 places, 13 transitions, 41 flow [2023-08-26 12:28:31,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=41, PETRI_PLACES=25, PETRI_TRANSITIONS=13} [2023-08-26 12:28:31,329 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -9 predicate places. [2023-08-26 12:28:31,329 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 13 transitions, 41 flow [2023-08-26 12:28:31,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:28:31,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2100056271, now seen corresponding path program 1 times [2023-08-26 12:28:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114407625] [2023-08-26 12:28:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:31,445 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,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:31,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114407625] [2023-08-26 12:28:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114407625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:31,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:28:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136226059] [2023-08-26 12:28:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:31,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:31,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:31,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 192 [2023-08-26 12:28:31,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 13 transitions, 41 flow. Second operand has 3 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-26 12:28:31,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:31,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 192 [2023-08-26 12:28:31,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:31,479 INFO L124 PetriNetUnfolderBase]: 17/50 cut-off events. [2023-08-26 12:28:31,480 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 12:28:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 50 events. 17/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 4 based on Foata normal form. 10/60 useless extension candidates. Maximal degree in co-relation 123. Up to 33 conditions per place. [2023-08-26 12:28:31,481 INFO L140 encePairwiseOnDemand]: 187/192 looper letters, 10 selfloop transitions, 5 changer transitions 0/16 dead transitions. [2023-08-26 12:28:31,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 16 transitions, 79 flow [2023-08-26 12:28:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2023-08-26 12:28:31,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2023-08-26 12:28:31,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2023-08-26 12:28:31,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2023-08-26 12:28:31,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:31,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2023-08-26 12:28:31,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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,486 INFO L175 Difference]: Start difference. First operand has 25 places, 13 transitions, 41 flow. Second operand 3 states and 261 transitions. [2023-08-26 12:28:31,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 16 transitions, 79 flow [2023-08-26 12:28:31,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 77 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:31,488 INFO L231 Difference]: Finished difference. Result has 26 places, 13 transitions, 49 flow [2023-08-26 12:28:31,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=26, PETRI_TRANSITIONS=13} [2023-08-26 12:28:31,488 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -8 predicate places. [2023-08-26 12:28:31,488 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 13 transitions, 49 flow [2023-08-26 12:28:31,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-26 12:28:31,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:31,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:28:31,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:31,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -354623096, now seen corresponding path program 1 times [2023-08-26 12:28:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401520380] [2023-08-26 12:28:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:31,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:28:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:31,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:28:31,573 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:28:31,574 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f1Err0ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:28:31,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:28:31,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:28:31,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-08-26 12:28:31,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:28:31,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:28:31,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:28:31,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:28:31,578 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:31,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:28:31,583 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:28:31,634 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,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:28:31,635 INFO L158 Benchmark]: Toolchain (without parser) took 7007.64ms. Allocated memory was 350.2MB in the beginning and 429.9MB in the end (delta: 79.7MB). Free memory was 324.7MB in the beginning and 196.1MB in the end (delta: 128.5MB). Peak memory consumption was 209.6MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,635 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 350.2MB. Free memory is still 326.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:28:31,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.98ms. Allocated memory is still 350.2MB. Free memory was 324.1MB in the beginning and 285.6MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.84ms. Allocated memory is still 350.2MB. Free memory was 285.6MB in the beginning and 283.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,636 INFO L158 Benchmark]: Boogie Preprocessor took 64.17ms. Allocated memory is still 350.2MB. Free memory was 283.0MB in the beginning and 280.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,636 INFO L158 Benchmark]: RCFGBuilder took 592.99ms. Allocated memory is still 350.2MB. Free memory was 280.4MB in the beginning and 311.2MB in the end (delta: -30.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,637 INFO L158 Benchmark]: TraceAbstraction took 5600.62ms. Allocated memory was 350.2MB in the beginning and 429.9MB in the end (delta: 79.7MB). Free memory was 310.2MB in the beginning and 196.1MB in the end (delta: 114.1MB). Peak memory consumption was 192.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:31,638 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 350.2MB. Free memory is still 326.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 690.98ms. Allocated memory is still 350.2MB. Free memory was 324.1MB in the beginning and 285.6MB in the end (delta: 38.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.84ms. Allocated memory is still 350.2MB. Free memory was 285.6MB in the beginning and 283.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 64.17ms. Allocated memory is still 350.2MB. Free memory was 283.0MB in the beginning and 280.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 592.99ms. Allocated memory is still 350.2MB. Free memory was 280.4MB in the beginning and 311.2MB in the end (delta: -30.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.0GB. * TraceAbstraction took 5600.62ms. Allocated memory was 350.2MB in the beginning and 429.9MB in the end (delta: 79.7MB). Free memory was 310.2MB in the beginning and 196.1MB in the end (delta: 114.1MB). Peak memory consumption was 192.7MB. 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.7s, 93 PlacesBefore, 34 PlacesAfterwards, 88 TransitionsBefore, 29 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3054 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2028, independent: 1874, independent conditional: 0, independent unconditional: 1874, 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: 697, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2028, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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)=1150, argc=1150, argv={1152:1151}, argv={1152:1151}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-2, t1={5:0}, t2={6:0}] [L1356] 1 g = 1 VAL [cond={4:0}, g=1, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\old(argc)=1150, argc=1150, argv={1152:1151}, argv={1152:1151}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=-1, ptr={0:0}, t1={5:0}, t2={6:0}] [L1366] 2 g = 0 VAL [cond={4:0}, g=0, mut={3:0}, ptr={0:0}, ptr={0:0}] [L1369] 2 return ((void *)0); [L1358] CALL 1 __VERIFIER_assert(g == 1) [L19] COND TRUE 1 !(cond) [L19] CALL 1 reach_error() [L18] COND FALSE 1 !(0) [L18] 1 __assert_fail ("0", "13-privatized_67-pthread_cond_wait_true.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, cond={4:0}, g=0, mut={3:0}, ptr={0: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: 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. - 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. - 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: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 2 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, InterpolantAutomatonStates: 20, 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.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...