/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/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:16:53,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:16:53,856 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 19:16:53,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:16:53,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:16:53,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:16:53,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:16:53,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:16:53,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:16:53,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:16:53,911 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:16:53,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:16:53,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:16:53,912 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:16:53,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:16:53,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:16:53,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:16:53,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:16:53,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:16:53,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:16:53,914 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:16:53,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:16:53,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:16:53,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:16:53,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:16:53,916 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:16:53,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:16:53,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:16:53,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:16:53,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:16:53,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:16:53,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:16:53,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:16:53,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:16:53,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:16:53,919 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 19:16:54,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:16:54,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:16:54,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:16:54,279 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:16:54,281 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:16:54,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 19:16:55,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:16:55,739 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:16:55,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 19:16:55,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d796951a9/9780900e1c2745af939971736424d261/FLAG988508240 [2023-08-26 19:16:55,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d796951a9/9780900e1c2745af939971736424d261 [2023-08-26 19:16:55,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:16:55,760 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:16:55,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:55,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:16:55,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:16:55,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:55" (1/1) ... [2023-08-26 19:16:55,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33230dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:55, skipping insertion in model container [2023-08-26 19:16:55,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:55" (1/1) ... [2023-08-26 19:16:55,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:16:55,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:55,971 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:16:55,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:56,014 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:16:56,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56 WrapperNode [2023-08-26 19:16:56,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:56,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:56,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:16:56,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:16:56,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,051 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2023-08-26 19:16:56,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:56,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:16:56,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:16:56,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:16:56,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:16:56,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:16:56,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:16:56,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:16:56,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (1/1) ... [2023-08-26 19:16:56,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:16:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:56,122 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 19:16:56,147 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 19:16:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:16:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 19:16:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 19:16:56,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 19:16:56,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 19:16:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:16:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:16:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:16:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:16:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:16:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:16:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:16:56,169 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 19:16:56,273 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:16:56,275 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:16:56,503 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:16:56,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:16:56,508 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 19:16:56,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:56 BoogieIcfgContainer [2023-08-26 19:16:56,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:16:56,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:16:56,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:16:56,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:16:56,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:16:55" (1/3) ... [2023-08-26 19:16:56,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a559eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:56, skipping insertion in model container [2023-08-26 19:16:56,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:56" (2/3) ... [2023-08-26 19:16:56,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a559eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:56, skipping insertion in model container [2023-08-26 19:16:56,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:56" (3/3) ... [2023-08-26 19:16:56,517 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-26 19:16:56,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:16:56,530 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 19:16:56,530 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:16:56,579 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 19:16:56,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 19:16:56,641 INFO L124 PetriNetUnfolderBase]: 6/84 cut-off events. [2023-08-26 19:16:56,641 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 19:16:56,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 6/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-08-26 19:16:56,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 19:16:56,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 162 flow [2023-08-26 19:16:56,653 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:16:56,661 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 19:16:56,664 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 19:16:56,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 162 flow [2023-08-26 19:16:56,682 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2023-08-26 19:16:56,683 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 19:16:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-08-26 19:16:56,684 INFO L119 LiptonReduction]: Number of co-enabled transitions 348 [2023-08-26 19:16:59,300 INFO L134 LiptonReduction]: Checked pairs total: 457 [2023-08-26 19:16:59,301 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-26 19:16:59,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:16:59,319 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;@60964d85, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:16:59,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-26 19:16:59,320 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:16:59,320 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 19:16:59,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:16:59,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:59,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:16:59,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:16:59,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 1 times [2023-08-26 19:16:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:59,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558788953] [2023-08-26 19:16:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:59,423 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 19:16:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558788953] [2023-08-26 19:16:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558788953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:59,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:16:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31458462] [2023-08-26 19:16:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:16:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:59,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:16:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:16:59,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 164 [2023-08-26 19:16:59,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 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 19:16:59,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:59,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 164 [2023-08-26 19:16:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:59,523 INFO L124 PetriNetUnfolderBase]: 45/80 cut-off events. [2023-08-26 19:16:59,523 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 19:16:59,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 80 events. 45/80 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 150 event pairs, 21 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 124. Up to 81 conditions per place. [2023-08-26 19:16:59,525 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 19 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 19:16:59,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 88 flow [2023-08-26 19:16:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:16:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:16:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 175 transitions. [2023-08-26 19:16:59,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335365853658537 [2023-08-26 19:16:59,538 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 175 transitions. [2023-08-26 19:16:59,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 175 transitions. [2023-08-26 19:16:59,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:59,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 175 transitions. [2023-08-26 19:16:59,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 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 19:16:59,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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 19:16:59,548 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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 19:16:59,549 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 2 states and 175 transitions. [2023-08-26 19:16:59,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 88 flow [2023-08-26 19:16:59,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 19:16:59,554 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2023-08-26 19:16:59,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2023-08-26 19:16:59,559 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 19:16:59,559 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2023-08-26 19:16:59,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 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 19:16:59,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:59,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:16:59,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:16:59,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:16:59,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 314240, now seen corresponding path program 1 times [2023-08-26 19:16:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143082539] [2023-08-26 19:16:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:59,665 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 19:16:59,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143082539] [2023-08-26 19:16:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143082539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:59,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:59,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:16:59,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93177281] [2023-08-26 19:16:59,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:59,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:59,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:59,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:59,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:59,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 164 [2023-08-26 19:16:59,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 19:16:59,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:59,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 164 [2023-08-26 19:16:59,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:59,708 INFO L124 PetriNetUnfolderBase]: 41/72 cut-off events. [2023-08-26 19:16:59,708 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:59,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 41/72 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 19 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 147. Up to 72 conditions per place. [2023-08-26 19:16:59,709 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 16 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2023-08-26 19:16:59,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 17 transitions, 72 flow [2023-08-26 19:16:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-08-26 19:16:59,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39227642276422764 [2023-08-26 19:16:59,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-08-26 19:16:59,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-08-26 19:16:59,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:59,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-08-26 19:16:59,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 19:16:59,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:16:59,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:16:59,715 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 42 flow. Second operand 3 states and 193 transitions. [2023-08-26 19:16:59,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 17 transitions, 72 flow [2023-08-26 19:16:59,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:16:59,716 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 40 flow [2023-08-26 19:16:59,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2023-08-26 19:16:59,717 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 19:16:59,717 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 40 flow [2023-08-26 19:16:59,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 19:16:59,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:59,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 19:16:59,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:16:59,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:16:59,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash 314241, now seen corresponding path program 1 times [2023-08-26 19:16:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970973936] [2023-08-26 19:16:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:59,886 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 19:16:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:59,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970973936] [2023-08-26 19:16:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970973936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:59,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:16:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118414543] [2023-08-26 19:16:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:59,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:59,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 164 [2023-08-26 19:16:59,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 19:16:59,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:59,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 164 [2023-08-26 19:16:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:59,926 INFO L124 PetriNetUnfolderBase]: 37/64 cut-off events. [2023-08-26 19:16:59,926 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:59,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 64 events. 37/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 17 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 132. Up to 64 conditions per place. [2023-08-26 19:16:59,928 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 14 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2023-08-26 19:16:59,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 66 flow [2023-08-26 19:16:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2023-08-26 19:16:59,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40040650406504064 [2023-08-26 19:16:59,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2023-08-26 19:16:59,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2023-08-26 19:16:59,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:59,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2023-08-26 19:16:59,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 19:16:59,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:16:59,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:16:59,937 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 40 flow. Second operand 3 states and 197 transitions. [2023-08-26 19:16:59,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 66 flow [2023-08-26 19:16:59,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 15 transitions, 65 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:16:59,938 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 37 flow [2023-08-26 19:16:59,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2023-08-26 19:16:59,940 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 19:16:59,940 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 37 flow [2023-08-26 19:16:59,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 19:16:59,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:59,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:16:59,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:16:59,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:16:59,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 301993336, now seen corresponding path program 1 times [2023-08-26 19:16:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032188772] [2023-08-26 19:16:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:00,073 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 19:17:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:00,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032188772] [2023-08-26 19:17:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032188772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:17:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862745400] [2023-08-26 19:17:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:00,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:00,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 164 [2023-08-26 19:17:00,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 37 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:00,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:00,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 164 [2023-08-26 19:17:00,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:00,116 INFO L124 PetriNetUnfolderBase]: 29/52 cut-off events. [2023-08-26 19:17:00,116 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:17:00,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 52 events. 29/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 13 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 109. Up to 52 conditions per place. [2023-08-26 19:17:00,117 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 13 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2023-08-26 19:17:00,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 63 flow [2023-08-26 19:17:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-08-26 19:17:00,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2023-08-26 19:17:00,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-08-26 19:17:00,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-08-26 19:17:00,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:00,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-08-26 19:17:00,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 19:17:00,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,122 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 37 flow. Second operand 3 states and 180 transitions. [2023-08-26 19:17:00,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 63 flow [2023-08-26 19:17:00,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 14 transitions, 62 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:00,123 INFO L231 Difference]: Finished difference. Result has 20 places, 14 transitions, 36 flow [2023-08-26 19:17:00,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=20, PETRI_TRANSITIONS=14} [2023-08-26 19:17:00,124 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 19:17:00,125 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 36 flow [2023-08-26 19:17:00,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:00,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:00,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:17:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 19:17:00,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:00,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 301993337, now seen corresponding path program 1 times [2023-08-26 19:17:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962306805] [2023-08-26 19:17:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:00,241 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 19:17:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:00,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962306805] [2023-08-26 19:17:00,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962306805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:17:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706728526] [2023-08-26 19:17:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:00,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:00,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 164 [2023-08-26 19:17:00,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:00,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:00,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 164 [2023-08-26 19:17:00,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:00,270 INFO L124 PetriNetUnfolderBase]: 21/40 cut-off events. [2023-08-26 19:17:00,271 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:17:00,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 40 events. 21/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 9 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 86. Up to 40 conditions per place. [2023-08-26 19:17:00,272 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 12 selfloop transitions, 1 changer transitions 0/13 dead transitions. [2023-08-26 19:17:00,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 13 transitions, 60 flow [2023-08-26 19:17:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-08-26 19:17:00,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2023-08-26 19:17:00,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-08-26 19:17:00,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-08-26 19:17:00,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:00,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-08-26 19:17:00,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 19:17:00,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,281 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 36 flow. Second operand 3 states and 182 transitions. [2023-08-26 19:17:00,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 13 transitions, 60 flow [2023-08-26 19:17:00,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 13 transitions, 59 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:00,282 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 35 flow [2023-08-26 19:17:00,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=35, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-08-26 19:17:00,285 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 19:17:00,285 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 35 flow [2023-08-26 19:17:00,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:00,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:00,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:00,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:17:00,286 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:00,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash -682426354, now seen corresponding path program 1 times [2023-08-26 19:17:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585366280] [2023-08-26 19:17:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:00,421 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 19:17:00,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585366280] [2023-08-26 19:17:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585366280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:17:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758691702] [2023-08-26 19:17:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:17:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:00,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:17:00,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:17:00,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 164 [2023-08-26 19:17:00,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 19:17:00,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:00,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 164 [2023-08-26 19:17:00,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:00,472 INFO L124 PetriNetUnfolderBase]: 41/77 cut-off events. [2023-08-26 19:17:00,472 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:17:00,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 77 events. 41/77 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 167 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 163. Up to 51 conditions per place. [2023-08-26 19:17:00,474 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-08-26 19:17:00,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 104 flow [2023-08-26 19:17:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:17:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:17:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2023-08-26 19:17:00,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2023-08-26 19:17:00,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 219 transitions. [2023-08-26 19:17:00,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 219 transitions. [2023-08-26 19:17:00,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:00,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 219 transitions. [2023-08-26 19:17:00,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 19:17:00,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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 19:17:00,478 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 35 flow. Second operand 3 states and 219 transitions. [2023-08-26 19:17:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 104 flow [2023-08-26 19:17:00,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 23 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:00,479 INFO L231 Difference]: Finished difference. Result has 22 places, 15 transitions, 53 flow [2023-08-26 19:17:00,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=22, PETRI_TRANSITIONS=15} [2023-08-26 19:17:00,482 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2023-08-26 19:17:00,482 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 53 flow [2023-08-26 19:17:00,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 19:17:00,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:00,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:00,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:17:00,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:00,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash -258027523, now seen corresponding path program 1 times [2023-08-26 19:17:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387329175] [2023-08-26 19:17:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387329175] [2023-08-26 19:17:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387329175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:00,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:00,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:17:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413486363] [2023-08-26 19:17:00,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:00,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:00,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:00,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:17:00,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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 19:17:00,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:00,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:17:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:00,674 INFO L124 PetriNetUnfolderBase]: 35/71 cut-off events. [2023-08-26 19:17:00,675 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 19:17:00,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 71 events. 35/71 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 157 event pairs, 6 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 177. Up to 45 conditions per place. [2023-08-26 19:17:00,677 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 15 selfloop transitions, 3 changer transitions 10/28 dead transitions. [2023-08-26 19:17:00,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 139 flow [2023-08-26 19:17:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:17:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:17:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2023-08-26 19:17:00,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2023-08-26 19:17:00,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 282 transitions. [2023-08-26 19:17:00,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 282 transitions. [2023-08-26 19:17:00,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:00,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 282 transitions. [2023-08-26 19:17:00,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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 19:17:00,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 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 19:17:00,681 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 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 19:17:00,681 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 53 flow. Second operand 4 states and 282 transitions. [2023-08-26 19:17:00,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 139 flow [2023-08-26 19:17:00,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:00,683 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 63 flow [2023-08-26 19:17:00,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2023-08-26 19:17:00,686 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-26 19:17:00,686 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 15 transitions, 63 flow [2023-08-26 19:17:00,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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 19:17:00,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:00,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:00,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:17:00,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:00,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 633309805, now seen corresponding path program 2 times [2023-08-26 19:17:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:00,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948145945] [2023-08-26 19:17:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948145945] [2023-08-26 19:17:00,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948145945] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367281477] [2023-08-26 19:17:00,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:17:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:00,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:00,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:17:00,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:17:00,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:17:00,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 19:17:00,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367281477] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:01,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 19:17:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348382741] [2023-08-26 19:17:01,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:01,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:17:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:17:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:17:01,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:17:01,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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 19:17:01,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:01,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:17:01,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:01,208 INFO L124 PetriNetUnfolderBase]: 34/63 cut-off events. [2023-08-26 19:17:01,208 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 19:17:01,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 63 events. 34/63 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 110 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 189. Up to 39 conditions per place. [2023-08-26 19:17:01,209 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-08-26 19:17:01,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 156 flow [2023-08-26 19:17:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:17:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:17:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2023-08-26 19:17:01,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2023-08-26 19:17:01,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 345 transitions. [2023-08-26 19:17:01,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 345 transitions. [2023-08-26 19:17:01,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:01,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 345 transitions. [2023-08-26 19:17:01,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 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 19:17:01,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 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 19:17:01,214 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 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 19:17:01,214 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 63 flow. Second operand 5 states and 345 transitions. [2023-08-26 19:17:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 156 flow [2023-08-26 19:17:01,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 19:17:01,215 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 92 flow [2023-08-26 19:17:01,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-26 19:17:01,216 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-26 19:17:01,216 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 92 flow [2023-08-26 19:17:01,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 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 19:17:01,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:01,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 19:17:01,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:01,422 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:01,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash -539296094, now seen corresponding path program 1 times [2023-08-26 19:17:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336438726] [2023-08-26 19:17:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336438726] [2023-08-26 19:17:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336438726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:17:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:17:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:17:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811370103] [2023-08-26 19:17:01,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:17:01,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:17:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:01,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:17:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:17:01,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:17:01,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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 19:17:01,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:01,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:17:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:01,584 INFO L124 PetriNetUnfolderBase]: 40/73 cut-off events. [2023-08-26 19:17:01,584 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 19:17:01,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 73 events. 40/73 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 264. Up to 61 conditions per place. [2023-08-26 19:17:01,585 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 21 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2023-08-26 19:17:01,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 169 flow [2023-08-26 19:17:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:17:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:17:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2023-08-26 19:17:01,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192073170731707 [2023-08-26 19:17:01,587 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 275 transitions. [2023-08-26 19:17:01,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 275 transitions. [2023-08-26 19:17:01,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:17:01,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 275 transitions. [2023-08-26 19:17:01,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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 19:17:01,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 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 19:17:01,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 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 19:17:01,589 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 92 flow. Second operand 4 states and 275 transitions. [2023-08-26 19:17:01,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 169 flow [2023-08-26 19:17:01,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 162 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 19:17:01,593 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 103 flow [2023-08-26 19:17:01,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-26 19:17:01,594 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-08-26 19:17:01,596 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 103 flow [2023-08-26 19:17:01,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 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 19:17:01,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:17:01,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:17:01,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 19:17:01,597 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:17:01,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:17:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1071375987, now seen corresponding path program 1 times [2023-08-26 19:17:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:17:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703622436] [2023-08-26 19:17:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:01,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:17:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:17:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703622436] [2023-08-26 19:17:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703622436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:17:02,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861864721] [2023-08-26 19:17:02,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:17:02,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:17:02,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:17:02,005 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:17:02,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:17:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:17:02,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:17:02,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:17:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:37,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:17:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:17:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861864721] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:17:41,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:17:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2023-08-26 19:17:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785023513] [2023-08-26 19:17:41,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:17:41,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:17:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:17:41,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:17:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=166, Unknown=8, NotChecked=0, Total=240 [2023-08-26 19:17:41,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:17:41,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 103 flow. Second operand has 16 states, 16 states have (on average 64.875) internal successors, (1038), 16 states have internal predecessors, (1038), 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 19:17:41,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:17:41,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:17:41,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:17:43,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:17:52,753 WARN L234 SmtUtils]: Spent 5.39s on a formula simplification. DAG size of input: 51 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:18:05,162 WARN L234 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 71 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:18:10,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:18:27,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:18:33,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:18:46,073 INFO L124 PetriNetUnfolderBase]: 166/306 cut-off events. [2023-08-26 19:18:46,073 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2023-08-26 19:18:46,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 306 events. 166/306 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1139 event pairs, 4 based on Foata normal form. 7/313 useless extension candidates. Maximal degree in co-relation 1134. Up to 107 conditions per place. [2023-08-26 19:18:46,076 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 56 selfloop transitions, 34 changer transitions 18/108 dead transitions. [2023-08-26 19:18:46,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 108 transitions, 703 flow [2023-08-26 19:18:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 19:18:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 19:18:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1049 transitions. [2023-08-26 19:18:46,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264227642276423 [2023-08-26 19:18:46,085 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1049 transitions. [2023-08-26 19:18:46,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1049 transitions. [2023-08-26 19:18:46,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:18:46,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1049 transitions. [2023-08-26 19:18:46,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 69.93333333333334) internal successors, (1049), 15 states have internal predecessors, (1049), 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 19:18:46,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 164.0) internal successors, (2624), 16 states have internal predecessors, (2624), 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 19:18:46,091 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 164.0) internal successors, (2624), 16 states have internal predecessors, (2624), 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 19:18:46,091 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 103 flow. Second operand 15 states and 1049 transitions. [2023-08-26 19:18:46,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 108 transitions, 703 flow [2023-08-26 19:18:46,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 108 transitions, 692 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 19:18:46,096 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 429 flow [2023-08-26 19:18:46,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=429, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-26 19:18:46,096 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-08-26 19:18:46,096 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 429 flow [2023-08-26 19:18:46,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 64.875) internal successors, (1038), 16 states have internal predecessors, (1038), 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 19:18:46,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:18:46,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:18:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:18:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-26 19:18:46,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:18:46,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:18:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1491328013, now seen corresponding path program 2 times [2023-08-26 19:18:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:18:46,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38398237] [2023-08-26 19:18:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:18:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:18:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:18:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:18:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:18:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38398237] [2023-08-26 19:18:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38398237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:18:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275055507] [2023-08-26 19:18:46,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:18:46,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:18:46,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:18:46,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:18:46,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 19:18:46,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:18:46,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:18:46,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 19:18:46,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:19:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:19:02,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:19:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:19:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275055507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:19:05,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:19:05,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 19:19:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336381601] [2023-08-26 19:19:05,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:19:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 19:19:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:19:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 19:19:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=150, Unknown=6, NotChecked=0, Total=210 [2023-08-26 19:19:05,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:19:05,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 429 flow. Second operand has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 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 19:19:05,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:19:05,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:19:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:19:08,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:10,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:16,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:18,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:20,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:41,248 WARN L234 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:19:43,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:49,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:51,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:53,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:55,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:57,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:19:59,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:01,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:03,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:05,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:07,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:10,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:21,929 WARN L234 SmtUtils]: Spent 11.71s on a formula simplification. DAG size of input: 57 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:20:24,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:37,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:39,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:20:43,040 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (div (* (- 1) c_~x2~0) 2)) (.cse9 (* 4294967296 (div c_~x1~0 4294967296)))) (let ((.cse2 (* c_~x1~0 3)) (.cse3 (* (div (+ c_~x2~0 (* (- 2) c_~x1~0)) 4294967296) 4294967296)) (.cse1 (+ .cse9 c_~x2~0)) (.cse7 (* c_~x1~0 2)) (.cse12 (* (- 1) c_~x1~0)) (.cse8 (* (div c_~x2~0 4294967296) 4294967296)) (.cse0 (mod (* .cse10 4294967295) 4294967296)) (.cse4 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= (+ .cse0 1) (mod c_~x1~0 4294967296)) (<= .cse1 (+ .cse2 .cse3)) (= (mod c_~x1~0 2) 0) (or (< (* 2 (mod c_~x1~0 2147483648)) .cse4) (let ((.cse6 (+ .cse7 .cse8)) (.cse5 (* (div c_~x1~0 2147483648) 4294967296))) (and (<= (+ .cse5 c_~x2~0) .cse6) (< .cse6 (+ .cse5 c_~x2~0 1))))) (< .cse9 c_~x1~0) (= (+ .cse10 (* (div (* (- 1) .cse10) 4294967296) 4294967296)) (let ((.cse11 (div .cse12 2))) (+ .cse11 (* (div (* (- 1) .cse11) 4294967296) 4294967296)))) (= (+ c_~x1~0 .cse8) .cse1) (<= .cse4 (mod c_~x2~0 4294967296)) (<= .cse1 (+ .cse7 (* (div (+ .cse12 c_~x2~0) 4294967296) 4294967296))) (<= (+ .cse9 c_~n~0 .cse8) (+ .cse2 .cse3 (* 4294967296 (div c_~n~0 4294967296)))) (<= .cse1 (+ .cse7 (* (div (+ .cse12 4294967295) 4294967296) 4294967296) .cse8)) (< .cse0 .cse4)))) is different from false [2023-08-26 19:20:45,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:00,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:03,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:06,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:21:06,985 INFO L124 PetriNetUnfolderBase]: 247/481 cut-off events. [2023-08-26 19:21:06,985 INFO L125 PetriNetUnfolderBase]: For 1970/1970 co-relation queries the response was YES. [2023-08-26 19:21:06,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 481 events. 247/481 cut-off events. For 1970/1970 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2172 event pairs, 26 based on Foata normal form. 8/489 useless extension candidates. Maximal degree in co-relation 2421. Up to 260 conditions per place. [2023-08-26 19:21:06,989 INFO L140 encePairwiseOnDemand]: 156/164 looper letters, 95 selfloop transitions, 37 changer transitions 23/155 dead transitions. [2023-08-26 19:21:06,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 155 transitions, 1397 flow [2023-08-26 19:21:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 19:21:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 19:21:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1451 transitions. [2023-08-26 19:21:06,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42131242740998837 [2023-08-26 19:21:06,995 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1451 transitions. [2023-08-26 19:21:06,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1451 transitions. [2023-08-26 19:21:06,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:21:06,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1451 transitions. [2023-08-26 19:21:06,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 69.0952380952381) internal successors, (1451), 21 states have internal predecessors, (1451), 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 19:21:07,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 164.0) internal successors, (3608), 22 states have internal predecessors, (3608), 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 19:21:07,006 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 164.0) internal successors, (3608), 22 states have internal predecessors, (3608), 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 19:21:07,006 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 429 flow. Second operand 21 states and 1451 transitions. [2023-08-26 19:21:07,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 155 transitions, 1397 flow [2023-08-26 19:21:07,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 155 transitions, 1288 flow, removed 53 selfloop flow, removed 2 redundant places. [2023-08-26 19:21:07,020 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 808 flow [2023-08-26 19:21:07,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=808, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2023-08-26 19:21:07,021 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 56 predicate places. [2023-08-26 19:21:07,021 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 808 flow [2023-08-26 19:21:07,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 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 19:21:07,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:21:07,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:21:07,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 19:21:07,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:07,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:21:07,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:21:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2088997148, now seen corresponding path program 3 times [2023-08-26 19:21:07,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:21:07,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958436257] [2023-08-26 19:21:07,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:21:07,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:21:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:21:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:21:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:21:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958436257] [2023-08-26 19:21:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958436257] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:21:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886257733] [2023-08-26 19:21:07,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:21:07,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:21:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:21:07,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:21:07,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 19:21:53,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 19:21:53,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:21:53,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 19:21:53,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:22:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:05,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:22:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:22:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886257733] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:22:26,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:22:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2023-08-26 19:22:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130027279] [2023-08-26 19:22:26,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:22:26,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:22:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:22:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:22:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=175, Unknown=11, NotChecked=0, Total=240 [2023-08-26 19:22:26,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:22:26,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 808 flow. Second operand has 16 states, 16 states have (on average 65.0625) internal successors, (1041), 16 states have internal predecessors, (1041), 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 19:22:26,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:22:26,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:22:26,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:22:59,482 WARN L234 SmtUtils]: Spent 29.76s on a formula simplification. DAG size of input: 66 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:23:01,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:03,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:05,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:08,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:14,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:16,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:22,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:25,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:27,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:29,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:45,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:48,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:23:50,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:08,892 WARN L234 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:24:10,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:13,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:15,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:18,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:20,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:24:22,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:13,428 WARN L234 SmtUtils]: Spent 36.03s on a formula simplification. DAG size of input: 73 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:25:15,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:26,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:28,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:30,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:32,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:39,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:25:42,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:09,442 WARN L234 SmtUtils]: Spent 17.10s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:26:11,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:13,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:27,024 WARN L234 SmtUtils]: Spent 10.44s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:26:29,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:36,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:38,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:40,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:41,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:43,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:45,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:48,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:50,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:26:52,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:10,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:12,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:31,005 WARN L234 SmtUtils]: Spent 16.32s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:27:32,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:37,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:40,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:44,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:46,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:56,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:27:58,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:13,132 WARN L234 SmtUtils]: Spent 12.71s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:28:15,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:24,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:27,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:30,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:34,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:37,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:39,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:28:40,895 INFO L124 PetriNetUnfolderBase]: 498/996 cut-off events. [2023-08-26 19:28:40,895 INFO L125 PetriNetUnfolderBase]: For 11294/11294 co-relation queries the response was YES. [2023-08-26 19:28:40,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6101 conditions, 996 events. 498/996 cut-off events. For 11294/11294 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5796 event pairs, 4 based on Foata normal form. 36/1032 useless extension candidates. Maximal degree in co-relation 6068. Up to 303 conditions per place. [2023-08-26 19:28:40,903 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 161 selfloop transitions, 122 changer transitions 24/307 dead transitions. [2023-08-26 19:28:40,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 307 transitions, 3420 flow [2023-08-26 19:28:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-26 19:28:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-26 19:28:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2478 transitions. [2023-08-26 19:28:40,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41971544715447157 [2023-08-26 19:28:40,911 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2478 transitions. [2023-08-26 19:28:40,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2478 transitions. [2023-08-26 19:28:40,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:28:40,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2478 transitions. [2023-08-26 19:28:40,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 68.83333333333333) internal successors, (2478), 36 states have internal predecessors, (2478), 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 19:28:40,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 164.0) internal successors, (6068), 37 states have internal predecessors, (6068), 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 19:28:40,925 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 164.0) internal successors, (6068), 37 states have internal predecessors, (6068), 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 19:28:40,925 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 808 flow. Second operand 36 states and 2478 transitions. [2023-08-26 19:28:40,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 307 transitions, 3420 flow [2023-08-26 19:28:40,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 307 transitions, 3032 flow, removed 188 selfloop flow, removed 6 redundant places. [2023-08-26 19:28:40,956 INFO L231 Difference]: Finished difference. Result has 126 places, 178 transitions, 1970 flow [2023-08-26 19:28:40,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1970, PETRI_PLACES=126, PETRI_TRANSITIONS=178} [2023-08-26 19:28:40,957 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 100 predicate places. [2023-08-26 19:28:40,957 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 178 transitions, 1970 flow [2023-08-26 19:28:40,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 65.0625) internal successors, (1041), 16 states have internal predecessors, (1041), 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 19:28:40,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:28:40,958 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:28:40,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 19:28:41,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:28:41,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 19:28:41,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:28:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1423351939, now seen corresponding path program 4 times [2023-08-26 19:28:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:28:41,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722053970] [2023-08-26 19:28:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:28:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:28:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:28:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:28:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:28:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722053970] [2023-08-26 19:28:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722053970] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:28:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067108015] [2023-08-26 19:28:41,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 19:28:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:28:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:28:41,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:28:41,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 19:28:54,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 19:28:54,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:28:54,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 19:28:54,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:29:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 19:29:38,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:29:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:29:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067108015] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:29:56,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:29:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2023-08-26 19:29:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860248931] [2023-08-26 19:29:56,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:29:56,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 19:29:56,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:29:56,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 19:29:56,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=176, Unknown=14, NotChecked=0, Total=240 [2023-08-26 19:29:56,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 19:29:56,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 178 transitions, 1970 flow. Second operand has 16 states, 16 states have (on average 65.5625) internal successors, (1049), 16 states have internal predecessors, (1049), 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 19:29:56,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:29:56,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 19:29:56,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:29:58,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:00,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:02,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:05,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:08,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:10,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:12,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:25,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:27,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:39,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:40,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:42,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:44,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:47,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:49,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:30:56,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:02,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:08,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:10,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:12,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:13,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:15,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:17,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:19,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:24,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:26,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 19:31:32,607 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:31:32,609 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:31:33,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 19:31:33,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-26 19:31:33,367 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2023-08-26 19:31:33,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 19:31:33,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 19:31:33,568 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2023-08-26 19:31:33,569 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2023-08-26 19:31:33,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2023-08-26 19:31:33,570 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2023-08-26 19:31:33,570 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:31:33,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:31:33,573 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:31:33,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:31:33 BasicIcfg [2023-08-26 19:31:33,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:31:33,575 INFO L158 Benchmark]: Toolchain (without parser) took 877815.48ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 323.3MB in the beginning and 249.8MB in the end (delta: 73.5MB). Peak memory consumption was 156.3MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,575 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 348.1MB. Free memory was 324.7MB in the beginning and 324.6MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 348.1MB. Free memory was 323.3MB in the beginning and 312.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.94ms. Allocated memory is still 348.1MB. Free memory was 312.8MB in the beginning and 311.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,576 INFO L158 Benchmark]: Boogie Preprocessor took 32.52ms. Allocated memory is still 348.1MB. Free memory was 311.2MB in the beginning and 309.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,576 INFO L158 Benchmark]: RCFGBuilder took 425.10ms. Allocated memory is still 348.1MB. Free memory was 309.9MB in the beginning and 296.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,576 INFO L158 Benchmark]: TraceAbstraction took 877062.73ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 295.3MB in the beginning and 249.8MB in the end (delta: 45.4MB). Peak memory consumption was 126.9MB. Max. memory is 16.0GB. [2023-08-26 19:31:33,585 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.18ms. Allocated memory is still 348.1MB. Free memory was 324.7MB in the beginning and 324.6MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 254.18ms. Allocated memory is still 348.1MB. Free memory was 323.3MB in the beginning and 312.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.94ms. Allocated memory is still 348.1MB. Free memory was 312.8MB in the beginning and 311.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.52ms. Allocated memory is still 348.1MB. Free memory was 311.2MB in the beginning and 309.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 425.10ms. Allocated memory is still 348.1MB. Free memory was 309.9MB in the beginning and 296.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 877062.73ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 295.3MB in the beginning and 249.8MB in the end (delta: 45.4MB). Peak memory consumption was 126.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 76 PlacesBefore, 26 PlacesAfterwards, 75 TransitionsBefore, 21 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 78 TotalNumberOfCompositions, 457 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 457, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 457, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 63/164 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 2131 conditions, 302 events (166/301 cut-off events. For 6411/6411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 1568 event pairs, 1 based on Foata normal form. 6/394 useless extension candidates. Maximal degree in co-relation 2085. Up to 118 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 93 locations, 11 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: 877.0s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 657.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 91 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 266.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 494 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 265.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2141 IncrementalHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 0 mSDtfsCounter, 2141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 84 SyntacticMatches, 14 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 521.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1970occurred in iteration=12, InterpolantAutomatonStates: 102, 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.1s SsaConstructionTime, 59.7s SatisfiabilityAnalysisTime, 155.3s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 6517 SizeOfPredicates, 17 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 14/50 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 could not prove your program: Timeout Completed graceful shutdown