/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:28:25,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:28:25,847 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:25,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:28:25,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:28:25,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:28:25,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:28:25,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:28:25,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:28:25,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:28:25,876 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:28:25,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:28:25,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:28:25,877 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:28:25,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:28:25,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:28:25,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:28:25,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:28:25,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:28:25,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:28:25,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:28:25,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:28:25,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:28:25,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:28:25,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:28:25,884 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:28:25,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:28:25,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:25,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:28:25,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:28:25,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:28:25,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:28:25,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:28:25,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:28:25,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:28:25,887 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:26,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:28:26,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:28:26,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:28:26,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:28:26,231 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:28:26,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-08-26 12:28:27,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:28:27,733 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:28:27,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-08-26 12:28:27,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e844bf5bd/9c3a93e7973a47eb9b93ab163649bc9a/FLAG14fd493a9 [2023-08-26 12:28:27,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e844bf5bd/9c3a93e7973a47eb9b93ab163649bc9a [2023-08-26 12:28:27,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:28:27,775 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:28:27,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:27,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:28:27,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:28:27,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:27" (1/1) ... [2023-08-26 12:28:27,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667f2caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:27, skipping insertion in model container [2023-08-26 12:28:27,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:28:27" (1/1) ... [2023-08-26 12:28:27,833 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:28:28,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:28,374 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:28:28,400 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [231] [2023-08-26 12:28:28,402 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-26 12:28:28,407 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [730] [2023-08-26 12:28:28,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:28:28,519 WARN L669 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:28:28,525 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:28:28,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:28 WrapperNode [2023-08-26 12:28:28,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:28:28,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:28,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:28:28,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:28:28,533 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:28" (1/1) ... [2023-08-26 12:28:28,559 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:28" (1/1) ... [2023-08-26 12:28:28,584 INFO L138 Inliner]: procedures = 354, calls = 39, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2023-08-26 12:28:28,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:28:28,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:28:28,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:28:28,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:28:28,593 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:28" (1/1) ... [2023-08-26 12:28:28,594 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:28" (1/1) ... [2023-08-26 12:28:28,600 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:28" (1/1) ... [2023-08-26 12:28:28,601 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:28" (1/1) ... [2023-08-26 12:28:28,608 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:28" (1/1) ... [2023-08-26 12:28:28,622 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:28" (1/1) ... [2023-08-26 12:28:28,625 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:28" (1/1) ... [2023-08-26 12:28:28,627 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:28" (1/1) ... [2023-08-26 12:28:28,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:28:28,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:28:28,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:28:28,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:28:28,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:28" (1/1) ... [2023-08-26 12:28:28,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:28:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:28:28,669 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:28,690 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:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-08-26 12:28:28,707 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2023-08-26 12:28:28,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2023-08-26 12:28:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2023-08-26 12:28:28,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2023-08-26 12:28:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:28:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:28:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:28:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:28:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 12:28:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:28:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:28:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:28:28,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:28:28,712 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:28,977 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:28:28,979 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:28:29,121 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:28:29,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:28:29,127 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:28:29,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:29 BoogieIcfgContainer [2023-08-26 12:28:29,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:28:29,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:28:29,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:28:29,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:28:29,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:28:27" (1/3) ... [2023-08-26 12:28:29,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5decd641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:29, skipping insertion in model container [2023-08-26 12:28:29,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:28:28" (2/3) ... [2023-08-26 12:28:29,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5decd641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:28:29, skipping insertion in model container [2023-08-26 12:28:29,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:28:29" (3/3) ... [2023-08-26 12:28:29,136 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2023-08-26 12:28:29,151 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:28:29,151 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 12:28:29,151 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:28:29,221 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 12:28:29,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:29,314 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2023-08-26 12:28:29,315 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:28:29,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 98 events. 2/98 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-08-26 12:28:29,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 100 transitions, 216 flow [2023-08-26 12:28:29,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:29,329 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:28:29,350 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:29,354 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:29,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 187 flow [2023-08-26 12:28:29,382 INFO L124 PetriNetUnfolderBase]: 2/89 cut-off events. [2023-08-26 12:28:29,382 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:28:29,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 89 events. 2/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-08-26 12:28:29,384 INFO L119 LiptonReduction]: Number of co-enabled transitions 1196 [2023-08-26 12:28:33,265 INFO L134 LiptonReduction]: Checked pairs total: 3464 [2023-08-26 12:28:33,266 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-08-26 12:28:33,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:28:33,289 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;@30c43c48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:28:33,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:28:33,291 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:28:33,291 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:28:33,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:33,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:33,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:28:33,292 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:33,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 363, now seen corresponding path program 1 times [2023-08-26 12:28:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453943169] [2023-08-26 12:28:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:33,481 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:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453943169] [2023-08-26 12:28:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453943169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:28:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199686626] [2023-08-26 12:28:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:28:33,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:28:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:28:33,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 189 [2023-08-26 12:28:33,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:33,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:33,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 189 [2023-08-26 12:28:33,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:33,622 INFO L124 PetriNetUnfolderBase]: 287/533 cut-off events. [2023-08-26 12:28:33,622 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-26 12:28:33,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 533 events. 287/533 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2307 event pairs, 287 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 945. Up to 509 conditions per place. [2023-08-26 12:28:33,627 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-26 12:28:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 109 flow [2023-08-26 12:28:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:28:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:28:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2023-08-26 12:28:33,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5661375661375662 [2023-08-26 12:28:33,639 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 214 transitions. [2023-08-26 12:28:33,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 214 transitions. [2023-08-26 12:28:33,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:33,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 214 transitions. [2023-08-26 12:28:33,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:33,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:33,648 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:33,650 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 71 flow. Second operand 2 states and 214 transitions. [2023-08-26 12:28:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 109 flow [2023-08-26 12:28:33,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:28:33,654 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 56 flow [2023-08-26 12:28:33,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-26 12:28:33,658 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-26 12:28:33,658 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 56 flow [2023-08-26 12:28:33,658 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:33,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:33,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:33,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:28:33,659 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:33,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash 354708, now seen corresponding path program 1 times [2023-08-26 12:28:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028277550] [2023-08-26 12:28:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:33,933 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:33,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:33,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028277550] [2023-08-26 12:28:33,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028277550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:33,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:33,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:33,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751669582] [2023-08-26 12:28:33,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:33,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 189 [2023-08-26 12:28:33,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:33,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:33,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 189 [2023-08-26 12:28:33,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,006 INFO L124 PetriNetUnfolderBase]: 276/508 cut-off events. [2023-08-26 12:28:34,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:34,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 508 events. 276/508 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2176 event pairs, 276 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1005. Up to 484 conditions per place. [2023-08-26 12:28:34,015 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 21 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-08-26 12:28:34,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 96 flow [2023-08-26 12:28:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2023-08-26 12:28:34,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2023-08-26 12:28:34,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 246 transitions. [2023-08-26 12:28:34,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 246 transitions. [2023-08-26 12:28:34,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 246 transitions. [2023-08-26 12:28:34,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,024 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 56 flow. Second operand 3 states and 246 transitions. [2023-08-26 12:28:34,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 96 flow [2023-08-26 12:28:34,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:28:34,025 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 54 flow [2023-08-26 12:28:34,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-26 12:28:34,026 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-26 12:28:34,026 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 54 flow [2023-08-26 12:28:34,026 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:34,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:28:34,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:28:34,034 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:34,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 354706, now seen corresponding path program 1 times [2023-08-26 12:28:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395197161] [2023-08-26 12:28:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:34,102 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:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395197161] [2023-08-26 12:28:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395197161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68276800] [2023-08-26 12:28:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:34,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:34,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:34,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 189 [2023-08-26 12:28:34,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:34,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 189 [2023-08-26 12:28:34,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,155 INFO L124 PetriNetUnfolderBase]: 265/483 cut-off events. [2023-08-26 12:28:34,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:34,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 483 events. 265/483 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2055 event pairs, 265 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 957. Up to 460 conditions per place. [2023-08-26 12:28:34,158 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 19 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-08-26 12:28:34,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 90 flow [2023-08-26 12:28:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 238 transitions. [2023-08-26 12:28:34,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2023-08-26 12:28:34,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 238 transitions. [2023-08-26 12:28:34,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 238 transitions. [2023-08-26 12:28:34,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 238 transitions. [2023-08-26 12:28:34,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,164 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 238 transitions. [2023-08-26 12:28:34,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 90 flow [2023-08-26 12:28:34,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 89 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:34,165 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 51 flow [2023-08-26 12:28:34,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-26 12:28:34,166 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:34,166 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 51 flow [2023-08-26 12:28:34,166 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:34,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:34,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:28:34,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:34,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 340881123, now seen corresponding path program 1 times [2023-08-26 12:28:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293805595] [2023-08-26 12:28:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:34,273 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:34,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293805595] [2023-08-26 12:28:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293805595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:34,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:34,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413640390] [2023-08-26 12:28:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:34,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:28:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:34,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:28:34,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:28:34,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2023-08-26 12:28:34,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:34,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2023-08-26 12:28:34,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,329 INFO L124 PetriNetUnfolderBase]: 194/365 cut-off events. [2023-08-26 12:28:34,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:34,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 365 events. 194/365 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1464 event pairs, 194 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 727. Up to 347 conditions per place. [2023-08-26 12:28:34,331 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 18 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-26 12:28:34,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 87 flow [2023-08-26 12:28:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-08-26 12:28:34,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.400352733686067 [2023-08-26 12:28:34,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-08-26 12:28:34,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-08-26 12:28:34,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-08-26 12:28:34,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,337 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 51 flow. Second operand 3 states and 227 transitions. [2023-08-26 12:28:34,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 87 flow [2023-08-26 12:28:34,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:34,339 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 50 flow [2023-08-26 12:28:34,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-26 12:28:34,340 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:34,341 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 50 flow [2023-08-26 12:28:34,341 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:34,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:28:34,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:28:34,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:34,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash 340881124, now seen corresponding path program 1 times [2023-08-26 12:28:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296637231] [2023-08-26 12:28:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:34,465 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:34,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:34,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296637231] [2023-08-26 12:28:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296637231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:34,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:28:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910631573] [2023-08-26 12:28:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:34,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:28:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:34,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:28:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:28:34,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 189 [2023-08-26 12:28:34,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:34,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 189 [2023-08-26 12:28:34,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,508 INFO L124 PetriNetUnfolderBase]: 123/247 cut-off events. [2023-08-26 12:28:34,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:34,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 247 events. 123/247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 897 event pairs, 123 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 497. Up to 234 conditions per place. [2023-08-26 12:28:34,509 INFO L140 encePairwiseOnDemand]: 187/189 looper letters, 13 selfloop transitions, 1 changer transitions 5/20 dead transitions. [2023-08-26 12:28:34,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 84 flow [2023-08-26 12:28:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2023-08-26 12:28:34,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4038800705467372 [2023-08-26 12:28:34,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2023-08-26 12:28:34,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2023-08-26 12:28:34,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2023-08-26 12:28:34,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,513 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 50 flow. Second operand 3 states and 229 transitions. [2023-08-26 12:28:34,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 84 flow [2023-08-26 12:28:34,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 83 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:34,514 INFO L231 Difference]: Finished difference. Result has 30 places, 15 transitions, 39 flow [2023-08-26 12:28:34,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=39, PETRI_PLACES=30, PETRI_TRANSITIONS=15} [2023-08-26 12:28:34,515 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-26 12:28:34,515 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 15 transitions, 39 flow [2023-08-26 12:28:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 12:28:34,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:28:34,516 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:34,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1977380701, now seen corresponding path program 1 times [2023-08-26 12:28:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068281742] [2023-08-26 12:28:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:34,617 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:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068281742] [2023-08-26 12:28:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068281742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:34,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:28:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433479122] [2023-08-26 12:28:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:34,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:34,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:34,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:34,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 189 [2023-08-26 12:28:34,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 15 transitions, 39 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:34,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:34,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 189 [2023-08-26 12:28:34,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,653 INFO L124 PetriNetUnfolderBase]: 39/96 cut-off events. [2023-08-26 12:28:34,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:28:34,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 96 events. 39/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 267 event pairs, 25 based on Foata normal form. 10/106 useless extension candidates. Maximal degree in co-relation 203. Up to 58 conditions per place. [2023-08-26 12:28:34,654 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 15 selfloop transitions, 3 changer transitions 0/19 dead transitions. [2023-08-26 12:28:34,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 85 flow [2023-08-26 12:28:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-26 12:28:34,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4991181657848324 [2023-08-26 12:28:34,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-26 12:28:34,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-26 12:28:34,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-26 12:28:34,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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:34,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,659 INFO L175 Difference]: Start difference. First operand has 30 places, 15 transitions, 39 flow. Second operand 3 states and 283 transitions. [2023-08-26 12:28:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 85 flow [2023-08-26 12:28:34,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 19 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:28:34,659 INFO L231 Difference]: Finished difference. Result has 27 places, 15 transitions, 49 flow [2023-08-26 12:28:34,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=27, PETRI_TRANSITIONS=15} [2023-08-26 12:28:34,660 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-26 12:28:34,660 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 49 flow [2023-08-26 12:28:34,661 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:34,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:34,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:28:34,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:34,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1926341998, now seen corresponding path program 1 times [2023-08-26 12:28:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487335007] [2023-08-26 12:28:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:28:34,760 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:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:28:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487335007] [2023-08-26 12:28:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487335007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:28:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:28:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:28:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097024599] [2023-08-26 12:28:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:28:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:28:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:28:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:28:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:28:34,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 189 [2023-08-26 12:28:34,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:34,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:28:34,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 189 [2023-08-26 12:28:34,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:28:34,800 INFO L124 PetriNetUnfolderBase]: 24/65 cut-off events. [2023-08-26 12:28:34,800 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 12:28:34,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 65 events. 24/65 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 6 based on Foata normal form. 14/79 useless extension candidates. Maximal degree in co-relation 164. Up to 44 conditions per place. [2023-08-26 12:28:34,801 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 10 selfloop transitions, 3 changer transitions 7/20 dead transitions. [2023-08-26 12:28:34,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 102 flow [2023-08-26 12:28:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:28:34,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:28:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-08-26 12:28:34,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2023-08-26 12:28:34,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-08-26 12:28:34,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-08-26 12:28:34,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:28:34,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-08-26 12:28:34,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:34,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:28:34,805 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 49 flow. Second operand 3 states and 266 transitions. [2023-08-26 12:28:34,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 102 flow [2023-08-26 12:28:34,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:28:34,806 INFO L231 Difference]: Finished difference. Result has 27 places, 10 transitions, 37 flow [2023-08-26 12:28:34,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=27, PETRI_TRANSITIONS=10} [2023-08-26 12:28:34,806 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-26 12:28:34,807 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 10 transitions, 37 flow [2023-08-26 12:28:34,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:34,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:28:34,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:28:34,807 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:28:34,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:28:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -381219255, now seen corresponding path program 1 times [2023-08-26 12:28:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:28:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031720450] [2023-08-26 12:28:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:28:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:28:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:34,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:28:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:28:34,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:28:34,856 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:28:34,856 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:28:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-08-26 12:28:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:28:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:28:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:28:34,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:28:34,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:28:34,865 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:28:34,865 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:28:34,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:28:34 BasicIcfg [2023-08-26 12:28:34,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:28:34,887 INFO L158 Benchmark]: Toolchain (without parser) took 7112.05ms. Allocated memory was 352.3MB in the beginning and 455.1MB in the end (delta: 102.8MB). Free memory was 327.0MB in the beginning and 363.1MB in the end (delta: -36.1MB). Peak memory consumption was 67.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:34,887 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 352.3MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:28:34,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.38ms. Allocated memory is still 352.3MB. Free memory was 327.0MB in the beginning and 288.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:34,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 352.3MB. Free memory was 288.3MB in the beginning and 285.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:28:34,888 INFO L158 Benchmark]: Boogie Preprocessor took 45.30ms. Allocated memory is still 352.3MB. 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:34,888 INFO L158 Benchmark]: RCFGBuilder took 498.11ms. Allocated memory is still 352.3MB. Free memory was 283.0MB in the beginning and 316.5MB in the end (delta: -33.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 12:28:34,889 INFO L158 Benchmark]: TraceAbstraction took 5755.32ms. Allocated memory was 352.3MB in the beginning and 455.1MB in the end (delta: 102.8MB). Free memory was 315.6MB in the beginning and 363.1MB in the end (delta: -47.6MB). Peak memory consumption was 55.1MB. Max. memory is 16.0GB. [2023-08-26 12:28:34,890 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.16ms. Allocated memory is still 352.3MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 750.38ms. Allocated memory is still 352.3MB. Free memory was 327.0MB in the beginning and 288.3MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 352.3MB. Free memory was 288.3MB in the beginning and 285.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.30ms. Allocated memory is still 352.3MB. 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. * RCFGBuilder took 498.11ms. Allocated memory is still 352.3MB. Free memory was 283.0MB in the beginning and 316.5MB in the end (delta: -33.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 5755.32ms. Allocated memory was 352.3MB in the beginning and 455.1MB in the end (delta: 102.8MB). Free memory was 315.6MB in the beginning and 363.1MB in the end (delta: -47.6MB). Peak memory consumption was 55.1MB. 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.9s, 94 PlacesBefore, 36 PlacesAfterwards, 89 TransitionsBefore, 31 TransitionsAfterwards, 1196 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 3464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1661, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 642, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1661, independent: 886, independent conditional: 0, independent unconditional: 886, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 642, unknown conditional: 0, unknown unconditional: 642] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\old(argc)=1152, argc=1152, argv={1151:1150}, argv={1151:1150}, cond={4:0}, g=0, mut={3:0}, pthread_create(&t1,((void *)0),f1,((void *)0))=-2, ptr={0:0}, t1={5:0}, t2={6:0}] [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)=1152, argc=1152, argv={1151:1150}, argv={1151:1150}, cond={4:0}, g=1, mut={3:0}, pthread_create(&t2,((void *)0),f2,((void *)0))=-1, ptr={0:0}, ptr={0:0}, t1={5:0}, t2={6:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) [L19] CALL 2 reach_error() [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "13-privatized_67-pthread_cond_wait_unknown_1_pos.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [cond={4:0}, g=1, 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: 1377]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 132 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 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:34,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...