/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/pthread-ext/26_stack_cas_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 17:53:39,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 17:53:39,356 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 17:53:39,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 17:53:39,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 17:53:39,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 17:53:39,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 17:53:39,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 17:53:39,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 17:53:39,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 17:53:39,406 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 17:53:39,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 17:53:39,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 17:53:39,407 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 17:53:39,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 17:53:39,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 17:53:39,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 17:53:39,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 17:53:39,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 17:53:39,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 17:53:39,413 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 17:53:39,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 17:53:39,413 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 17:53:39,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 17:53:39,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 17:53:39,414 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 17:53:39,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 17:53:39,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:53:39,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 17:53:39,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 17:53:39,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 17:53:39,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 17:53:39,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 17:53:39,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 17:53:39,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 17:53:39,416 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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 17:53:39,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 17:53:39,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 17:53:39,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 17:53:39,734 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 17:53:39,737 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 17:53:39,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-26 17:53:40,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 17:53:41,266 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 17:53:41,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-26 17:53:41,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad0a48cf/cc05f8d17aba4f658095e2a17055e2c1/FLAG76bba9586 [2023-08-26 17:53:41,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad0a48cf/cc05f8d17aba4f658095e2a17055e2c1 [2023-08-26 17:53:41,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 17:53:41,301 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 17:53:41,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 17:53:41,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 17:53:41,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 17:53:41,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41, skipping insertion in model container [2023-08-26 17:53:41,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 17:53:41,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:53:41,667 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 17:53:41,684 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-26 17:53:41,685 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-26 17:53:41,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 17:53:41,741 INFO L206 MainTranslator]: Completed translation [2023-08-26 17:53:41,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41 WrapperNode [2023-08-26 17:53:41,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 17:53:41,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 17:53:41,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 17:53:41,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 17:53:41,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,783 INFO L138 Inliner]: procedures = 177, calls = 48, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 193 [2023-08-26 17:53:41,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 17:53:41,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 17:53:41,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 17:53:41,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 17:53:41,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 17:53:41,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 17:53:41,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 17:53:41,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 17:53:41,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (1/1) ... [2023-08-26 17:53:41,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 17:53:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 17:53:41,836 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 17:53:41,861 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 17:53:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 17:53:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-26 17:53:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-26 17:53:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 17:53:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 17:53:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 17:53:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 17:53:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 17:53:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 17:53:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 17:53:41,879 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 17:53:41,982 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 17:53:41,983 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 17:53:42,277 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 17:53:42,507 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 17:53:42,507 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-26 17:53:42,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:53:42 BoogieIcfgContainer [2023-08-26 17:53:42,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 17:53:42,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 17:53:42,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 17:53:42,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 17:53:42,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 05:53:41" (1/3) ... [2023-08-26 17:53:42,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6839372a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:53:42, skipping insertion in model container [2023-08-26 17:53:42,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 05:53:41" (2/3) ... [2023-08-26 17:53:42,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6839372a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 05:53:42, skipping insertion in model container [2023-08-26 17:53:42,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 05:53:42" (3/3) ... [2023-08-26 17:53:42,518 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2023-08-26 17:53:42,532 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 17:53:42,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-08-26 17:53:42,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 17:53:42,655 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 17:53:42,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,777 INFO L124 PetriNetUnfolderBase]: 11/168 cut-off events. [2023-08-26 17:53:42,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:53:42,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 168 events. 11/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 303 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-26 17:53:42,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,795 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 17:53:42,804 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,808 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 156 transitions, 317 flow [2023-08-26 17:53:42,868 INFO L124 PetriNetUnfolderBase]: 11/168 cut-off events. [2023-08-26 17:53:42,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:53:42,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 168 events. 11/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 303 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-26 17:53:42,874 INFO L119 LiptonReduction]: Number of co-enabled transitions 3540 [2023-08-26 17:53:49,591 INFO L134 LiptonReduction]: Checked pairs total: 5664 [2023-08-26 17:53:49,592 INFO L136 LiptonReduction]: Total number of compositions: 171 [2023-08-26 17:53:49,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 17:53:49,607 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;@35bb1cb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 17:53:49,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2023-08-26 17:53:49,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 17:53:49,610 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 17:53:49,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:53:49,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:49,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:53:49,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:49,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 31782, now seen corresponding path program 1 times [2023-08-26 17:53:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639946617] [2023-08-26 17:53:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:49,785 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 17:53:49,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:49,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639946617] [2023-08-26 17:53:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639946617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:49,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:49,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:53:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009817872] [2023-08-26 17:53:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:49,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:49,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 327 [2023-08-26 17:53:49,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 141 flow. Second operand has 3 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 17:53:49,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:49,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 327 [2023-08-26 17:53:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:50,034 INFO L124 PetriNetUnfolderBase]: 246/539 cut-off events. [2023-08-26 17:53:50,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 17:53:50,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 539 events. 246/539 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2377 event pairs, 126 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 1050. Up to 282 conditions per place. [2023-08-26 17:53:50,038 INFO L140 encePairwiseOnDemand]: 303/327 looper letters, 78 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2023-08-26 17:53:50,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 335 flow [2023-08-26 17:53:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-26 17:53:50,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38837920489296635 [2023-08-26 17:53:50,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-26 17:53:50,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-26 17:53:50,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:50,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-26 17:53:50,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 17:53:50,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,063 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 141 flow. Second operand 3 states and 381 transitions. [2023-08-26 17:53:50,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 335 flow [2023-08-26 17:53:50,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 335 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 17:53:50,067 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 133 flow [2023-08-26 17:53:50,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-26 17:53:50,071 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -13 predicate places. [2023-08-26 17:53:50,071 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 133 flow [2023-08-26 17:53:50,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 17:53:50,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:50,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 17:53:50,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 17:53:50,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:50,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash 31784, now seen corresponding path program 1 times [2023-08-26 17:53:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145282185] [2023-08-26 17:53:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:50,154 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 17:53:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145282185] [2023-08-26 17:53:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145282185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:53:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334362855] [2023-08-26 17:53:50,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:50,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 327 [2023-08-26 17:53:50,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 17:53:50,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:50,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 327 [2023-08-26 17:53:50,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:50,263 INFO L124 PetriNetUnfolderBase]: 172/402 cut-off events. [2023-08-26 17:53:50,263 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-08-26 17:53:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 402 events. 172/402 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1677 event pairs, 120 based on Foata normal form. 61/319 useless extension candidates. Maximal degree in co-relation 905. Up to 385 conditions per place. [2023-08-26 17:53:50,265 INFO L140 encePairwiseOnDemand]: 325/327 looper letters, 47 selfloop transitions, 1 changer transitions 1/51 dead transitions. [2023-08-26 17:53:50,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 229 flow [2023-08-26 17:53:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-26 17:53:50,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3292558613659531 [2023-08-26 17:53:50,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-26 17:53:50,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-26 17:53:50,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:50,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-26 17:53:50,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 17:53:50,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,272 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 133 flow. Second operand 3 states and 323 transitions. [2023-08-26 17:53:50,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 229 flow [2023-08-26 17:53:50,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:50,275 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 123 flow [2023-08-26 17:53:50,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2023-08-26 17:53:50,276 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -14 predicate places. [2023-08-26 17:53:50,276 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 123 flow [2023-08-26 17:53:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 17:53:50,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:50,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 17:53:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 17:53:50,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:50,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 30568877, now seen corresponding path program 1 times [2023-08-26 17:53:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381643801] [2023-08-26 17:53:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:50,455 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 17:53:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:50,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381643801] [2023-08-26 17:53:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381643801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:50,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:50,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774284509] [2023-08-26 17:53:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:50,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:53:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:53:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:53:50,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 327 [2023-08-26 17:53:50,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 17:53:50,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:50,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 327 [2023-08-26 17:53:50,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:50,624 INFO L124 PetriNetUnfolderBase]: 174/419 cut-off events. [2023-08-26 17:53:50,625 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-26 17:53:50,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 419 events. 174/419 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1838 event pairs, 114 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 942. Up to 246 conditions per place. [2023-08-26 17:53:50,627 INFO L140 encePairwiseOnDemand]: 322/327 looper letters, 72 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-26 17:53:50,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 329 flow [2023-08-26 17:53:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-26 17:53:50,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3394495412844037 [2023-08-26 17:53:50,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-26 17:53:50,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-26 17:53:50,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:50,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-26 17:53:50,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 17:53:50,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,634 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 123 flow. Second operand 3 states and 333 transitions. [2023-08-26 17:53:50,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 329 flow [2023-08-26 17:53:50,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:50,637 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 139 flow [2023-08-26 17:53:50,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-26 17:53:50,639 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -15 predicate places. [2023-08-26 17:53:50,639 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 139 flow [2023-08-26 17:53:50,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 17:53:50,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:50,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 17:53:50,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 17:53:50,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:50,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash 30569005, now seen corresponding path program 1 times [2023-08-26 17:53:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255486844] [2023-08-26 17:53:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:50,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 17:53:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255486844] [2023-08-26 17:53:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255486844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:50,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:50,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 17:53:50,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566859819] [2023-08-26 17:53:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:50,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:50,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 327 [2023-08-26 17:53:50,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 17:53:50,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:50,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 327 [2023-08-26 17:53:50,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:50,889 INFO L124 PetriNetUnfolderBase]: 159/400 cut-off events. [2023-08-26 17:53:50,889 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-08-26 17:53:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 400 events. 159/400 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1761 event pairs, 127 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 901. Up to 370 conditions per place. [2023-08-26 17:53:50,892 INFO L140 encePairwiseOnDemand]: 323/327 looper letters, 44 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-26 17:53:50,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 223 flow [2023-08-26 17:53:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-26 17:53:50,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3251783893985729 [2023-08-26 17:53:50,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-26 17:53:50,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-26 17:53:50,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:50,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-26 17:53:50,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 17:53:50,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:50,898 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 139 flow. Second operand 3 states and 319 transitions. [2023-08-26 17:53:50,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 223 flow [2023-08-26 17:53:50,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:50,902 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 132 flow [2023-08-26 17:53:50,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-08-26 17:53:50,905 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -17 predicate places. [2023-08-26 17:53:50,905 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 132 flow [2023-08-26 17:53:50,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 17:53:50,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:50,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 17:53:50,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 17:53:50,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:50,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash 30568878, now seen corresponding path program 1 times [2023-08-26 17:53:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:50,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221495988] [2023-08-26 17:53:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:51,056 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 17:53:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221495988] [2023-08-26 17:53:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221495988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:51,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474141021] [2023-08-26 17:53:51,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:51,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:53:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:53:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:53:51,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 327 [2023-08-26 17:53:51,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 17:53:51,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:51,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 327 [2023-08-26 17:53:51,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:51,155 INFO L124 PetriNetUnfolderBase]: 155/389 cut-off events. [2023-08-26 17:53:51,156 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-08-26 17:53:51,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 389 events. 155/389 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1715 event pairs, 123 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 871. Up to 360 conditions per place. [2023-08-26 17:53:51,159 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 17:53:51,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2023-08-26 17:53:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-26 17:53:51,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32823649337410804 [2023-08-26 17:53:51,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-26 17:53:51,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-26 17:53:51,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:51,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-26 17:53:51,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 17:53:51,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,169 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 132 flow. Second operand 3 states and 322 transitions. [2023-08-26 17:53:51,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2023-08-26 17:53:51,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:51,173 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 129 flow [2023-08-26 17:53:51,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-26 17:53:51,174 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2023-08-26 17:53:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 129 flow [2023-08-26 17:53:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 17:53:51,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:51,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 17:53:51,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 17:53:51,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:51,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 947636045, now seen corresponding path program 1 times [2023-08-26 17:53:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662310876] [2023-08-26 17:53:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:51,249 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 17:53:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662310876] [2023-08-26 17:53:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662310876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226644524] [2023-08-26 17:53:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:51,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:53:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:53:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:53:51,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 327 [2023-08-26 17:53:51,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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 17:53:51,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:51,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 327 [2023-08-26 17:53:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:51,396 INFO L124 PetriNetUnfolderBase]: 148/348 cut-off events. [2023-08-26 17:53:51,397 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-26 17:53:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 348 events. 148/348 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1393 event pairs, 50 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 793. Up to 178 conditions per place. [2023-08-26 17:53:51,399 INFO L140 encePairwiseOnDemand]: 320/327 looper letters, 59 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2023-08-26 17:53:51,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 313 flow [2023-08-26 17:53:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:53:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:53:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-26 17:53:51,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3103975535168196 [2023-08-26 17:53:51,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-26 17:53:51,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-26 17:53:51,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:51,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-26 17:53:51,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 17:53:51,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:51,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:51,405 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 129 flow. Second operand 4 states and 406 transitions. [2023-08-26 17:53:51,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 313 flow [2023-08-26 17:53:51,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:51,406 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 138 flow [2023-08-26 17:53:51,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-26 17:53:51,407 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2023-08-26 17:53:51,407 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 138 flow [2023-08-26 17:53:51,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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 17:53:51,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:51,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:51,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 17:53:51,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:51,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 149080917, now seen corresponding path program 1 times [2023-08-26 17:53:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:51,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805151568] [2023-08-26 17:53:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:51,431 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 17:53:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805151568] [2023-08-26 17:53:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805151568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:51,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:51,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908253539] [2023-08-26 17:53:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:51,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:51,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:51,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:51,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 327 [2023-08-26 17:53:51,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 17:53:51,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:51,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 327 [2023-08-26 17:53:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:51,512 INFO L124 PetriNetUnfolderBase]: 140/353 cut-off events. [2023-08-26 17:53:51,512 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-26 17:53:51,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 353 events. 140/353 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1509 event pairs, 46 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 813. Up to 317 conditions per place. [2023-08-26 17:53:51,514 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-26 17:53:51,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 224 flow [2023-08-26 17:53:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-26 17:53:51,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36493374108053006 [2023-08-26 17:53:51,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-26 17:53:51,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-26 17:53:51,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:51,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-26 17:53:51,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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 17:53:51,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,519 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 138 flow. Second operand 3 states and 358 transitions. [2023-08-26 17:53:51,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 224 flow [2023-08-26 17:53:51,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 206 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 17:53:51,521 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 122 flow [2023-08-26 17:53:51,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-26 17:53:51,521 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -20 predicate places. [2023-08-26 17:53:51,522 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 122 flow [2023-08-26 17:53:51,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 17:53:51,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:51,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:51,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 17:53:51,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:51,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash 208027579, now seen corresponding path program 1 times [2023-08-26 17:53:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765374918] [2023-08-26 17:53:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 17:53:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765374918] [2023-08-26 17:53:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765374918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988973336] [2023-08-26 17:53:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 17:53:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 17:53:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 17:53:51,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 327 [2023-08-26 17:53:51,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 17:53:51,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:51,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 327 [2023-08-26 17:53:51,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:51,747 INFO L124 PetriNetUnfolderBase]: 135/339 cut-off events. [2023-08-26 17:53:51,748 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-26 17:53:51,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 339 events. 135/339 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1426 event pairs, 106 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 761. Up to 313 conditions per place. [2023-08-26 17:53:51,749 INFO L140 encePairwiseOnDemand]: 325/327 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 17:53:51,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 196 flow [2023-08-26 17:53:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-26 17:53:51,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30988786952089703 [2023-08-26 17:53:51,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-26 17:53:51,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-26 17:53:51,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:51,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-26 17:53:51,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 17:53:51,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:51,754 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 122 flow. Second operand 3 states and 304 transitions. [2023-08-26 17:53:51,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 196 flow [2023-08-26 17:53:51,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:51,755 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 118 flow [2023-08-26 17:53:51,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-26 17:53:51,756 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -21 predicate places. [2023-08-26 17:53:51,756 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 118 flow [2023-08-26 17:53:51,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 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 17:53:51,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:51,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 17:53:51,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:51,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2141080974, now seen corresponding path program 1 times [2023-08-26 17:53:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485828229] [2023-08-26 17:53:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:51,894 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 17:53:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:51,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485828229] [2023-08-26 17:53:51,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485828229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:51,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:51,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 17:53:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677405888] [2023-08-26 17:53:51,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:51,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:53:51,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:51,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:53:51,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:53:51,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 327 [2023-08-26 17:53:51,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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 17:53:51,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:51,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 327 [2023-08-26 17:53:51,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:51,995 INFO L124 PetriNetUnfolderBase]: 128/301 cut-off events. [2023-08-26 17:53:51,995 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-26 17:53:51,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 301 events. 128/301 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1119 event pairs, 50 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 686. Up to 122 conditions per place. [2023-08-26 17:53:51,997 INFO L140 encePairwiseOnDemand]: 319/327 looper letters, 50 selfloop transitions, 9 changer transitions 0/60 dead transitions. [2023-08-26 17:53:51,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 280 flow [2023-08-26 17:53:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:53:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:53:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-26 17:53:51,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3103975535168196 [2023-08-26 17:53:51,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-26 17:53:51,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-26 17:53:51,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:51,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-26 17:53:52,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 17:53:52,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:52,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:52,004 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 118 flow. Second operand 4 states and 406 transitions. [2023-08-26 17:53:52,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 280 flow [2023-08-26 17:53:52,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:52,007 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 153 flow [2023-08-26 17:53:52,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-26 17:53:52,008 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -19 predicate places. [2023-08-26 17:53:52,008 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 153 flow [2023-08-26 17:53:52,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 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 17:53:52,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:52,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 17:53:52,010 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:52,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:52,010 INFO L85 PathProgramCache]: Analyzing trace with hash -289423631, now seen corresponding path program 1 times [2023-08-26 17:53:52,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:52,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874859285] [2023-08-26 17:53:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:52,059 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 17:53:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874859285] [2023-08-26 17:53:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874859285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:52,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:52,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:52,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871785208] [2023-08-26 17:53:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:52,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:52,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 327 [2023-08-26 17:53:52,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 17:53:52,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:52,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 327 [2023-08-26 17:53:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:52,169 INFO L124 PetriNetUnfolderBase]: 120/293 cut-off events. [2023-08-26 17:53:52,169 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-26 17:53:52,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 293 events. 120/293 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1133 event pairs, 52 based on Foata normal form. 3/202 useless extension candidates. Maximal degree in co-relation 712. Up to 240 conditions per place. [2023-08-26 17:53:52,171 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 40 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2023-08-26 17:53:52,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 251 flow [2023-08-26 17:53:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 17:53:52,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.363914373088685 [2023-08-26 17:53:52,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 17:53:52,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 17:53:52,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:52,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 17:53:52,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 17:53:52,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:52,176 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:52,176 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 153 flow. Second operand 3 states and 357 transitions. [2023-08-26 17:53:52,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 251 flow [2023-08-26 17:53:52,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:52,180 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 153 flow [2023-08-26 17:53:52,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-26 17:53:52,181 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2023-08-26 17:53:52,181 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 153 flow [2023-08-26 17:53:52,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 17:53:52,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:52,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:52,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 17:53:52,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:52,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash -289421895, now seen corresponding path program 1 times [2023-08-26 17:53:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:52,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43316626] [2023-08-26 17:53:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:52,284 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 17:53:52,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43316626] [2023-08-26 17:53:52,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43316626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:52,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:52,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 17:53:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142827923] [2023-08-26 17:53:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:52,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:53:52,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:53:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:53:52,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 327 [2023-08-26 17:53:52,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 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 17:53:52,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:52,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 327 [2023-08-26 17:53:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:52,459 INFO L124 PetriNetUnfolderBase]: 191/458 cut-off events. [2023-08-26 17:53:52,460 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-08-26 17:53:52,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 458 events. 191/458 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2093 event pairs, 23 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 1125. Up to 186 conditions per place. [2023-08-26 17:53:52,462 INFO L140 encePairwiseOnDemand]: 317/327 looper letters, 76 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2023-08-26 17:53:52,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 469 flow [2023-08-26 17:53:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 17:53:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 17:53:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 723 transitions. [2023-08-26 17:53:52,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31585845347313235 [2023-08-26 17:53:52,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 723 transitions. [2023-08-26 17:53:52,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 723 transitions. [2023-08-26 17:53:52,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:52,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 723 transitions. [2023-08-26 17:53:52,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.28571428571429) internal successors, (723), 7 states have internal predecessors, (723), 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 17:53:52,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 327.0) internal successors, (2616), 8 states have internal predecessors, (2616), 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 17:53:52,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 327.0) internal successors, (2616), 8 states have internal predecessors, (2616), 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 17:53:52,470 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 153 flow. Second operand 7 states and 723 transitions. [2023-08-26 17:53:52,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 469 flow [2023-08-26 17:53:52,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 465 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:52,473 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 243 flow [2023-08-26 17:53:52,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-26 17:53:52,473 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -9 predicate places. [2023-08-26 17:53:52,473 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 243 flow [2023-08-26 17:53:52,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 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 17:53:52,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:52,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 17:53:52,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:52,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash -382142036, now seen corresponding path program 1 times [2023-08-26 17:53:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63786493] [2023-08-26 17:53:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:52,517 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 17:53:52,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63786493] [2023-08-26 17:53:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63786493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:52,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:52,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:52,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945931198] [2023-08-26 17:53:52,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:52,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:52,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:52,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:52,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 327 [2023-08-26 17:53:52,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 17:53:52,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:52,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 327 [2023-08-26 17:53:52,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:52,615 INFO L124 PetriNetUnfolderBase]: 193/491 cut-off events. [2023-08-26 17:53:52,615 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-08-26 17:53:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 491 events. 193/491 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2240 event pairs, 147 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 1323. Up to 424 conditions per place. [2023-08-26 17:53:52,618 INFO L140 encePairwiseOnDemand]: 324/327 looper letters, 44 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-26 17:53:52,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 353 flow [2023-08-26 17:53:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 17:53:52,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36799184505606525 [2023-08-26 17:53:52,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 17:53:52,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 17:53:52,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:52,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 17:53:52,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:53:52,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:52,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:52,623 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 243 flow. Second operand 3 states and 361 transitions. [2023-08-26 17:53:52,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 353 flow [2023-08-26 17:53:52,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 334 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:52,625 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 243 flow [2023-08-26 17:53:52,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-26 17:53:52,626 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -8 predicate places. [2023-08-26 17:53:52,626 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 243 flow [2023-08-26 17:53:52,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 17:53:52,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:52,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 17:53:52,627 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err38ASSERT_VIOLATIONASSERT === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:52,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -382142034, now seen corresponding path program 1 times [2023-08-26 17:53:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54250925] [2023-08-26 17:53:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:52,691 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 17:53:52,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:52,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54250925] [2023-08-26 17:53:52,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54250925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:52,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:52,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 17:53:52,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556212779] [2023-08-26 17:53:52,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:52,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:53:52,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:52,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:53:52,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:53:52,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 327 [2023-08-26 17:53:52,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 17:53:52,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:52,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 327 [2023-08-26 17:53:52,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:52,837 INFO L124 PetriNetUnfolderBase]: 189/466 cut-off events. [2023-08-26 17:53:52,838 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2023-08-26 17:53:52,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 466 events. 189/466 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1970 event pairs, 25 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1272. Up to 316 conditions per place. [2023-08-26 17:53:52,840 INFO L140 encePairwiseOnDemand]: 320/327 looper letters, 62 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-08-26 17:53:52,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 441 flow [2023-08-26 17:53:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 17:53:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 17:53:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-08-26 17:53:52,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3109072375127421 [2023-08-26 17:53:52,843 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-08-26 17:53:52,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-08-26 17:53:52,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:52,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-08-26 17:53:52,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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 17:53:52,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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 17:53:52,847 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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 17:53:52,848 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 243 flow. Second operand 6 states and 610 transitions. [2023-08-26 17:53:52,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 441 flow [2023-08-26 17:53:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 17:53:52,850 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 243 flow [2023-08-26 17:53:52,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-26 17:53:52,850 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -4 predicate places. [2023-08-26 17:53:52,851 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 243 flow [2023-08-26 17:53:52,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 17:53:52,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:52,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 17:53:52,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:52,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1038460844, now seen corresponding path program 1 times [2023-08-26 17:53:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290064254] [2023-08-26 17:53:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:52,909 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 17:53:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:52,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290064254] [2023-08-26 17:53:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290064254] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:52,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838970533] [2023-08-26 17:53:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:52,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:52,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 327 [2023-08-26 17:53:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 17:53:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 327 [2023-08-26 17:53:52,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:52,994 INFO L124 PetriNetUnfolderBase]: 173/418 cut-off events. [2023-08-26 17:53:52,994 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2023-08-26 17:53:52,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 418 events. 173/418 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1724 event pairs, 43 based on Foata normal form. 0/317 useless extension candidates. Maximal degree in co-relation 1205. Up to 267 conditions per place. [2023-08-26 17:53:52,996 INFO L140 encePairwiseOnDemand]: 321/327 looper letters, 36 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-26 17:53:52,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 343 flow [2023-08-26 17:53:52,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-08-26 17:53:52,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29561671763506625 [2023-08-26 17:53:52,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-08-26 17:53:52,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-08-26 17:53:52,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:52,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-08-26 17:53:52,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 17:53:53,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:53,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:53,001 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 243 flow. Second operand 3 states and 290 transitions. [2023-08-26 17:53:53,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 343 flow [2023-08-26 17:53:53,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 17:53:53,003 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 243 flow [2023-08-26 17:53:53,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 17:53:53,004 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2023-08-26 17:53:53,004 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 243 flow [2023-08-26 17:53:53,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 17:53:53,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:53,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:53,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 17:53:53,004 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:53,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1038460845, now seen corresponding path program 1 times [2023-08-26 17:53:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616194652] [2023-08-26 17:53:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:53,111 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 17:53:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616194652] [2023-08-26 17:53:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616194652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:53,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 17:53:53,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686570027] [2023-08-26 17:53:53,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:53,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 17:53:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 17:53:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 17:53:53,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 327 [2023-08-26 17:53:53,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 17:53:53,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:53,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 327 [2023-08-26 17:53:53,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:53,187 INFO L124 PetriNetUnfolderBase]: 157/376 cut-off events. [2023-08-26 17:53:53,187 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2023-08-26 17:53:53,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 376 events. 157/376 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1465 event pairs, 43 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 1126. Up to 225 conditions per place. [2023-08-26 17:53:53,189 INFO L140 encePairwiseOnDemand]: 322/327 looper letters, 34 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2023-08-26 17:53:53,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 341 flow [2023-08-26 17:53:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 17:53:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 17:53:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-26 17:53:53,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29867482161060144 [2023-08-26 17:53:53,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-26 17:53:53,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-26 17:53:53,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:53,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-26 17:53:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 17:53:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:53,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 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 17:53:53,194 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 243 flow. Second operand 3 states and 293 transitions. [2023-08-26 17:53:53,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 341 flow [2023-08-26 17:53:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:53,196 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 239 flow [2023-08-26 17:53:53,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-26 17:53:53,197 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -12 predicate places. [2023-08-26 17:53:53,197 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 239 flow [2023-08-26 17:53:53,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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 17:53:53,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:53,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 17:53:53,197 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:53,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:53,198 INFO L85 PathProgramCache]: Analyzing trace with hash 138545289, now seen corresponding path program 1 times [2023-08-26 17:53:53,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:53,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379778398] [2023-08-26 17:53:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 17:53:53,288 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 17:53:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 17:53:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379778398] [2023-08-26 17:53:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379778398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 17:53:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 17:53:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 17:53:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180070620] [2023-08-26 17:53:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 17:53:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 17:53:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 17:53:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 17:53:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 17:53:53,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 327 [2023-08-26 17:53:53,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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 17:53:53,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 17:53:53,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 327 [2023-08-26 17:53:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 17:53:53,361 INFO L124 PetriNetUnfolderBase]: 148/349 cut-off events. [2023-08-26 17:53:53,361 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2023-08-26 17:53:53,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 349 events. 148/349 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1281 event pairs, 34 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 1051. Up to 225 conditions per place. [2023-08-26 17:53:53,363 INFO L140 encePairwiseOnDemand]: 322/327 looper letters, 32 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2023-08-26 17:53:53,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 335 flow [2023-08-26 17:53:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 17:53:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 17:53:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2023-08-26 17:53:53,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2706422018348624 [2023-08-26 17:53:53,365 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2023-08-26 17:53:53,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2023-08-26 17:53:53,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 17:53:53,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2023-08-26 17:53:53,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 17:53:53,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:53,369 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 327.0) internal successors, (1635), 5 states have internal predecessors, (1635), 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 17:53:53,369 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 239 flow. Second operand 4 states and 354 transitions. [2023-08-26 17:53:53,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 335 flow [2023-08-26 17:53:53,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 17:53:53,371 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 237 flow [2023-08-26 17:53:53,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=327, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-26 17:53:53,372 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, -12 predicate places. [2023-08-26 17:53:53,372 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 237 flow [2023-08-26 17:53:53,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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 17:53:53,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 17:53:53,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 17:53:53,373 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err38ASSERT_VIOLATIONASSERT === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2023-08-26 17:53:53,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 17:53:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash 138545291, now seen corresponding path program 1 times [2023-08-26 17:53:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 17:53:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172302661] [2023-08-26 17:53:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 17:53:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 17:53:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:53:53,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 17:53:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 17:53:53,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 17:53:53,452 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 17:53:53,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err38ASSERT_VIOLATIONASSERT (79 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (74 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2023-08-26 17:53:53,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2023-08-26 17:53:53,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONASSERT (61 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2023-08-26 17:53:53,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (51 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2023-08-26 17:53:53,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (39 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2023-08-26 17:53:53,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2023-08-26 17:53:53,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2023-08-26 17:53:53,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 80 remaining) [2023-08-26 17:53:53,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 80 remaining) [2023-08-26 17:53:53,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (0 of 80 remaining) [2023-08-26 17:53:53,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 17:53:53,462 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 17:53:53,463 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-26 17:53:53,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 17:53:53,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 17:53:53,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 05:53:53 BasicIcfg [2023-08-26 17:53:53,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 17:53:53,510 INFO L158 Benchmark]: Toolchain (without parser) took 12209.06ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 379.3MB in the beginning and 406.3MB in the end (delta: -26.9MB). Peak memory consumption was 154.3MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,510 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 404.8MB. Free memory is still 382.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 17:53:53,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.28ms. Allocated memory is still 404.8MB. Free memory was 379.3MB in the beginning and 359.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.24ms. Allocated memory is still 404.8MB. Free memory was 359.3MB in the beginning and 356.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,511 INFO L158 Benchmark]: Boogie Preprocessor took 25.10ms. Allocated memory is still 404.8MB. Free memory was 356.3MB in the beginning and 354.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,511 INFO L158 Benchmark]: RCFGBuilder took 701.37ms. Allocated memory is still 404.8MB. Free memory was 354.2MB in the beginning and 292.5MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,511 INFO L158 Benchmark]: TraceAbstraction took 10996.79ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 292.2MB in the beginning and 406.3MB in the end (delta: -114.1MB). Peak memory consumption was 68.3MB. Max. memory is 16.0GB. [2023-08-26 17:53:53,512 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.13ms. Allocated memory is still 404.8MB. Free memory is still 382.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.28ms. Allocated memory is still 404.8MB. Free memory was 379.3MB in the beginning and 359.3MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.24ms. Allocated memory is still 404.8MB. Free memory was 359.3MB in the beginning and 356.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.10ms. Allocated memory is still 404.8MB. Free memory was 356.3MB in the beginning and 354.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 701.37ms. Allocated memory is still 404.8MB. Free memory was 354.2MB in the beginning and 292.5MB in the end (delta: 61.7MB). Peak memory consumption was 60.8MB. Max. memory is 16.0GB. * TraceAbstraction took 10996.79ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 292.2MB in the beginning and 406.3MB in the end (delta: -114.1MB). Peak memory consumption was 68.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 149 PlacesBefore, 64 PlacesAfterwards, 156 TransitionsBefore, 68 TransitionsAfterwards, 3540 CoEnabledTransitionPairs, 5 FixpointIterations, 21 TrivialSequentialCompositions, 129 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 171 TotalNumberOfCompositions, 5664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4174, independent: 3915, independent conditional: 0, independent unconditional: 3915, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1754, independent conditional: 0, independent unconditional: 1754, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4174, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L714] 0 int memory[(2*960+1)]; [L715] 0 int next_alloc_idx = 1; [L716] 0 int m = 0; [L717] 0 int top; [L769] 0 int m2 = 0; [L770] 0 int state = 0; [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={7:0}, top={4:0}] [L789] COND TRUE 0 1 [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-2, state=0, t={7:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 [L777] RET 1 EBStack_init() [L778] 1 state = 1 [L779] 1 case 1: [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; [L763] 1 int arg = __VERIFIER_nondet_int(); [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*960+1)) [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() VAL [\old(d)=8, casret={6:0}, d=8, index_malloc()=1, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L743] COND FALSE 1 !(newTop == 0) [L746] EXPR 1 memory[newTop+0] [L746] 1 memory[newTop+0] = d VAL [\old(d)=8, casret={6:0}, d=8, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 [L748] EXPR 1 \read(top) [L748] 1 oldTop = top [L749] EXPR 1 memory[newTop+1] [L749] 1 memory[newTop+1] = oldTop [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) [L751] COND TRUE 1 casret==1 [L752] 1 return 1; VAL [\old(d)=8, \result=1, casret={6:0}, d=8, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L752] 1 return 1; [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) VAL [arg=8, m2={5:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top={4:0}] [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] CALL 1 reach_error() [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "26_stack_cas_longest-1.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [m2={5:0}, m={3:0}, next_alloc_idx=3, state=1, top={4: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: 749]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: -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: -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: 746]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds 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: -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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 257 locations, 81 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: 10.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 644 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 644 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1073 IncrementalHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 1073 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 17:53:53,541 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...