/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:50:36,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:50:36,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:50:36,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:50:36,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:50:36,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:50:36,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:50:36,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:50:36,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:50:36,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:50:36,855 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:50:36,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:50:36,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:50:36,857 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:50:36,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:50:36,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:50:36,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:50:36,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:50:36,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:50:36,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:50:36,859 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:50:36,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:50:36,860 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:50:36,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:50:36,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:50:36,861 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:50:36,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:50:36,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:50:36,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:50:36,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:50:36,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:50:36,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:50:36,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:50:36,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:50:36,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:50:36,864 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:50:37,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:50:37,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:50:37,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:50:37,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:50:37,221 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:50:37,222 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 12:50:38,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:50:38,678 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:50:38,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 12:50:38,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1340ceeb7/9727a1d26c534445b08fe8769e4f1c01/FLAGef3bae6ec [2023-08-26 12:50:38,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1340ceeb7/9727a1d26c534445b08fe8769e4f1c01 [2023-08-26 12:50:38,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:50:38,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:50:38,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:50:38,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:50:38,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:50:38,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cf498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38, skipping insertion in model container [2023-08-26 12:50:38,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,723 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:50:38,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:50:38,886 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:50:38,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:50:38,932 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:50:38,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38 WrapperNode [2023-08-26 12:50:38,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:50:38,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:50:38,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:50:38,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:50:38,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,977 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2023-08-26 12:50:38,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:50:38,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:50:38,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:50:38,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:50:38,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:38,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:50:39,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:50:39,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:50:39,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:50:39,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (1/1) ... [2023-08-26 12:50:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:50:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:50:39,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:50:39,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:50:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:50:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 12:50:39,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 12:50:39,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 12:50:39,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 12:50:39,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:50:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:50:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:50:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:50:39,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:50:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:50:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:50:39,089 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:50:39,193 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:50:39,195 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:50:39,435 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:50:39,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:50:39,440 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 12:50:39,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:50:39 BoogieIcfgContainer [2023-08-26 12:50:39,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:50:39,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:50:39,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:50:39,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:50:39,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:50:38" (1/3) ... [2023-08-26 12:50:39,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bec8ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:50:39, skipping insertion in model container [2023-08-26 12:50:39,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:50:38" (2/3) ... [2023-08-26 12:50:39,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bec8ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:50:39, skipping insertion in model container [2023-08-26 12:50:39,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:50:39" (3/3) ... [2023-08-26 12:50:39,451 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-26 12:50:39,467 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:50:39,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 12:50:39,468 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:50:39,553 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 12:50:39,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 12:50:39,651 INFO L124 PetriNetUnfolderBase]: 6/84 cut-off events. [2023-08-26 12:50:39,651 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:50:39,656 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 12:50:39,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 12:50:39,661 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 162 flow [2023-08-26 12:50:39,664 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:50:39,679 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 12:50:39,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 12:50:39,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 162 flow [2023-08-26 12:50:39,721 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2023-08-26 12:50:39,722 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:50:39,722 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 12:50:39,723 INFO L119 LiptonReduction]: Number of co-enabled transitions 348 [2023-08-26 12:50:42,281 INFO L134 LiptonReduction]: Checked pairs total: 457 [2023-08-26 12:50:42,281 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-26 12:50:42,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:50:42,298 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;@2ac6c071, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:50:42,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-26 12:50:42,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:50:42,300 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:50:42,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:50:42,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:42,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:50:42,301 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 12:50:42,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 1 times [2023-08-26 12:50:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:42,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371067111] [2023-08-26 12:50:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371067111] [2023-08-26 12:50:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371067111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:50:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512773951] [2023-08-26 12:50:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:42,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:50:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:50:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:50:42,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 164 [2023-08-26 12:50:42,427 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 12:50:42,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:42,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 164 [2023-08-26 12:50:42,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:42,492 INFO L124 PetriNetUnfolderBase]: 45/80 cut-off events. [2023-08-26 12:50:42,492 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 12:50:42,493 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 12:50:42,496 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 19 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 12:50:42,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 88 flow [2023-08-26 12:50:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:50:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:50:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 175 transitions. [2023-08-26 12:50:42,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335365853658537 [2023-08-26 12:50:42,507 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 175 transitions. [2023-08-26 12:50:42,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 175 transitions. [2023-08-26 12:50:42,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:42,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 175 transitions. [2023-08-26 12:50:42,512 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 12:50:42,516 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 12:50:42,516 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 12:50:42,518 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 2 states and 175 transitions. [2023-08-26 12:50:42,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 88 flow [2023-08-26 12:50:42,520 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 12:50:42,521 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2023-08-26 12:50:42,522 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 12:50:42,525 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 12:50:42,525 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2023-08-26 12:50:42,526 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 12:50:42,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:42,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:50:42,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:50:42,526 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 12:50:42,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 314240, now seen corresponding path program 1 times [2023-08-26 12:50:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796928918] [2023-08-26 12:50:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:42,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796928918] [2023-08-26 12:50:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796928918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:42,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483317103] [2023-08-26 12:50:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:42,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:42,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:42,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 164 [2023-08-26 12:50:42,647 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 12:50:42,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:42,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 164 [2023-08-26 12:50:42,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:42,676 INFO L124 PetriNetUnfolderBase]: 41/72 cut-off events. [2023-08-26 12:50:42,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:50:42,676 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 12:50:42,677 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 16 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2023-08-26 12:50:42,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 17 transitions, 72 flow [2023-08-26 12:50:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-08-26 12:50:42,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39227642276422764 [2023-08-26 12:50:42,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-08-26 12:50:42,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-08-26 12:50:42,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:42,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-08-26 12:50:42,681 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 12:50:42,683 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 12:50:42,683 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 12:50:42,683 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 42 flow. Second operand 3 states and 193 transitions. [2023-08-26 12:50:42,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 17 transitions, 72 flow [2023-08-26 12:50:42,684 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 12:50:42,684 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 40 flow [2023-08-26 12:50:42,684 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 12:50:42,685 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 12:50:42,685 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 40 flow [2023-08-26 12:50:42,686 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 12:50:42,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:42,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:50:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:50:42,686 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 12:50:42,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 314241, now seen corresponding path program 1 times [2023-08-26 12:50:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745433308] [2023-08-26 12:50:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:42,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745433308] [2023-08-26 12:50:42,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745433308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723122890] [2023-08-26 12:50:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:42,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:42,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 164 [2023-08-26 12:50:42,848 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 12:50:42,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:42,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 164 [2023-08-26 12:50:42,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:42,883 INFO L124 PetriNetUnfolderBase]: 37/64 cut-off events. [2023-08-26 12:50:42,883 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:50:42,883 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 12:50:42,884 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 14 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2023-08-26 12:50:42,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 66 flow [2023-08-26 12:50:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2023-08-26 12:50:42,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40040650406504064 [2023-08-26 12:50:42,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2023-08-26 12:50:42,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2023-08-26 12:50:42,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:42,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2023-08-26 12:50:42,890 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 12:50:42,893 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 12:50:42,893 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 12:50:42,893 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 40 flow. Second operand 3 states and 197 transitions. [2023-08-26 12:50:42,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 66 flow [2023-08-26 12:50:42,894 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 12:50:42,894 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 37 flow [2023-08-26 12:50:42,895 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 12:50:42,896 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 12:50:42,896 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 37 flow [2023-08-26 12:50:42,896 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 12:50:42,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:42,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:50:42,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:50:42,901 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 12:50:42,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 301993336, now seen corresponding path program 1 times [2023-08-26 12:50:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669447724] [2023-08-26 12:50:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669447724] [2023-08-26 12:50:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669447724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:50:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804374478] [2023-08-26 12:50:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:50:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:50:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:50:43,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 164 [2023-08-26 12:50:43,063 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 12:50:43,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:43,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 164 [2023-08-26 12:50:43,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:43,096 INFO L124 PetriNetUnfolderBase]: 29/52 cut-off events. [2023-08-26 12:50:43,096 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:50:43,096 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 12:50:43,097 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 13 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2023-08-26 12:50:43,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 63 flow [2023-08-26 12:50:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-08-26 12:50:43,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2023-08-26 12:50:43,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-08-26 12:50:43,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-08-26 12:50:43,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:43,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-08-26 12:50:43,100 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 12:50:43,101 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 12:50:43,101 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 12:50:43,101 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 37 flow. Second operand 3 states and 180 transitions. [2023-08-26 12:50:43,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 63 flow [2023-08-26 12:50:43,102 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 12:50:43,102 INFO L231 Difference]: Finished difference. Result has 20 places, 14 transitions, 36 flow [2023-08-26 12:50:43,102 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 12:50:43,103 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 12:50:43,103 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 36 flow [2023-08-26 12:50:43,103 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 12:50:43,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:43,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:50:43,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:50:43,104 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 12:50:43,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 301993337, now seen corresponding path program 1 times [2023-08-26 12:50:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599665100] [2023-08-26 12:50:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599665100] [2023-08-26 12:50:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599665100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:43,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:50:43,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512522316] [2023-08-26 12:50:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:43,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:50:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:50:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:50:43,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 164 [2023-08-26 12:50:43,192 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 12:50:43,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:43,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 164 [2023-08-26 12:50:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:43,218 INFO L124 PetriNetUnfolderBase]: 21/40 cut-off events. [2023-08-26 12:50:43,218 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:50:43,218 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 12:50:43,219 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 12 selfloop transitions, 1 changer transitions 0/13 dead transitions. [2023-08-26 12:50:43,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 13 transitions, 60 flow [2023-08-26 12:50:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-08-26 12:50:43,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2023-08-26 12:50:43,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-08-26 12:50:43,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-08-26 12:50:43,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:43,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-08-26 12:50:43,222 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 12:50:43,224 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 12:50:43,224 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 12:50:43,224 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 36 flow. Second operand 3 states and 182 transitions. [2023-08-26 12:50:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 13 transitions, 60 flow [2023-08-26 12:50:43,225 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 12:50:43,225 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 35 flow [2023-08-26 12:50:43,225 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 12:50:43,226 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 12:50:43,226 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 35 flow [2023-08-26 12:50:43,226 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 12:50:43,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:43,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:43,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:50:43,227 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 12:50:43,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash -682426354, now seen corresponding path program 1 times [2023-08-26 12:50:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615515681] [2023-08-26 12:50:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:50:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615515681] [2023-08-26 12:50:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615515681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:43,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:43,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:50:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448236646] [2023-08-26 12:50:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:43,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:50:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:50:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:50:43,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 164 [2023-08-26 12:50:43,355 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 12:50:43,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:43,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 164 [2023-08-26 12:50:43,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:43,398 INFO L124 PetriNetUnfolderBase]: 41/77 cut-off events. [2023-08-26 12:50:43,398 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 12:50:43,398 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 12:50:43,399 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-08-26 12:50:43,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 104 flow [2023-08-26 12:50:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:50:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:50:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2023-08-26 12:50:43,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2023-08-26 12:50:43,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 219 transitions. [2023-08-26 12:50:43,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 219 transitions. [2023-08-26 12:50:43,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:43,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 219 transitions. [2023-08-26 12:50:43,401 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 12:50:43,402 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 12:50:43,403 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 12:50:43,403 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 35 flow. Second operand 3 states and 219 transitions. [2023-08-26 12:50:43,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 104 flow [2023-08-26 12:50:43,404 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 12:50:43,404 INFO L231 Difference]: Finished difference. Result has 22 places, 15 transitions, 53 flow [2023-08-26 12:50:43,405 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 12:50:43,406 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2023-08-26 12:50:43,406 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 53 flow [2023-08-26 12:50:43,406 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 12:50:43,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:43,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:50:43,407 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 12:50:43,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash -258027523, now seen corresponding path program 1 times [2023-08-26 12:50:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:43,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898274994] [2023-08-26 12:50:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:43,507 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 12:50:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898274994] [2023-08-26 12:50:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898274994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14724910] [2023-08-26 12:50:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:43,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:50:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:50:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:50:43,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:50:43,510 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 12:50:43,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:43,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:50:43,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:43,565 INFO L124 PetriNetUnfolderBase]: 35/71 cut-off events. [2023-08-26 12:50:43,565 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 12:50:43,565 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 12:50:43,566 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 15 selfloop transitions, 3 changer transitions 10/28 dead transitions. [2023-08-26 12:50:43,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 139 flow [2023-08-26 12:50:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:50:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:50:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2023-08-26 12:50:43,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2023-08-26 12:50:43,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 282 transitions. [2023-08-26 12:50:43,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 282 transitions. [2023-08-26 12:50:43,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:43,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 282 transitions. [2023-08-26 12:50:43,569 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 12:50:43,570 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 12:50:43,570 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 12:50:43,570 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 53 flow. Second operand 4 states and 282 transitions. [2023-08-26 12:50:43,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 139 flow [2023-08-26 12:50:43,571 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 12:50:43,572 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 63 flow [2023-08-26 12:50:43,572 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 12:50:43,572 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-26 12:50:43,572 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 15 transitions, 63 flow [2023-08-26 12:50:43,573 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 12:50:43,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:43,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:43,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:50:43,573 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 12:50:43,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 633309805, now seen corresponding path program 2 times [2023-08-26 12:50:43,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:43,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941684719] [2023-08-26 12:50:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:43,656 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 12:50:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:43,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941684719] [2023-08-26 12:50:43,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941684719] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:50:43,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113082108] [2023-08-26 12:50:43,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 12:50:43,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:50:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:50:43,661 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 12:50:43,671 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 12:50:43,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 12:50:43,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:50:43,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 12:50:43,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:50:43,909 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 12:50:43,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:50:43,988 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 12:50:43,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113082108] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:50:43,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:50:43,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 12:50:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844863238] [2023-08-26 12:50:43,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:50:43,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:50:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:50:43,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:50:43,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:50:43,990 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 12:50:43,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:43,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:50:43,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:44,093 INFO L124 PetriNetUnfolderBase]: 34/63 cut-off events. [2023-08-26 12:50:44,093 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 12:50:44,094 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 12:50:44,094 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-08-26 12:50:44,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 156 flow [2023-08-26 12:50:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:50:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:50:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2023-08-26 12:50:44,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2023-08-26 12:50:44,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 345 transitions. [2023-08-26 12:50:44,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 345 transitions. [2023-08-26 12:50:44,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:44,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 345 transitions. [2023-08-26 12:50:44,097 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 12:50:44,098 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 12:50:44,099 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 12:50:44,099 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 63 flow. Second operand 5 states and 345 transitions. [2023-08-26 12:50:44,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 156 flow [2023-08-26 12:50:44,100 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 12:50:44,100 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 92 flow [2023-08-26 12:50:44,100 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 12:50:44,101 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-26 12:50:44,101 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 92 flow [2023-08-26 12:50:44,101 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 12:50:44,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:44,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:44,113 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 12:50:44,307 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 12:50:44,308 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 12:50:44,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash -539296094, now seen corresponding path program 1 times [2023-08-26 12:50:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:44,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875679930] [2023-08-26 12:50:44,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:44,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:44,391 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 12:50:44,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875679930] [2023-08-26 12:50:44,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875679930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:50:44,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:50:44,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:50:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066076734] [2023-08-26 12:50:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:50:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:50:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:50:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:50:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:50:44,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:50:44,398 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 12:50:44,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:50:44,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:50:44,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:50:44,456 INFO L124 PetriNetUnfolderBase]: 40/73 cut-off events. [2023-08-26 12:50:44,457 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 12:50:44,457 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 12:50:44,458 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 21 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2023-08-26 12:50:44,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 169 flow [2023-08-26 12:50:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:50:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:50:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2023-08-26 12:50:44,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192073170731707 [2023-08-26 12:50:44,459 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 275 transitions. [2023-08-26 12:50:44,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 275 transitions. [2023-08-26 12:50:44,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:50:44,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 275 transitions. [2023-08-26 12:50:44,460 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 12:50:44,461 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 12:50:44,462 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 12:50:44,462 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 92 flow. Second operand 4 states and 275 transitions. [2023-08-26 12:50:44,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 169 flow [2023-08-26 12:50:44,463 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 12:50:44,464 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 103 flow [2023-08-26 12:50:44,464 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 12:50:44,464 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-08-26 12:50:44,465 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 103 flow [2023-08-26 12:50:44,465 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 12:50:44,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:50:44,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:50:44,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:50:44,465 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 12:50:44,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:50:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1071375987, now seen corresponding path program 1 times [2023-08-26 12:50:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:50:44,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465740578] [2023-08-26 12:50:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:50:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:44,821 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 12:50:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:50:44,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465740578] [2023-08-26 12:50:44,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465740578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:50:44,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273282936] [2023-08-26 12:50:44,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:50:44,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:50:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:50:44,823 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 12:50:44,871 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 12:50:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:50:45,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 12:50:45,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:51:02,253 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 12:51:02,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:51:07,278 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 12:51:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273282936] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:51:07,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:51:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 12:51:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122924620] [2023-08-26 12:51:07,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:51:07,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 12:51:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:51:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 12:51:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=146, Unknown=7, NotChecked=0, Total=210 [2023-08-26 12:51:07,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:51:07,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 103 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 12:51:07,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:51:07,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:51:07,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:51:24,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:51:28,796 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 12:51:40,338 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 12:51:43,711 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 12:51:44,569 INFO L124 PetriNetUnfolderBase]: 141/267 cut-off events. [2023-08-26 12:51:44,570 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-08-26 12:51:44,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 267 events. 141/267 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 996 event pairs, 4 based on Foata normal form. 8/275 useless extension candidates. Maximal degree in co-relation 989. Up to 91 conditions per place. [2023-08-26 12:51:44,572 INFO L140 encePairwiseOnDemand]: 156/164 looper letters, 52 selfloop transitions, 24 changer transitions 19/95 dead transitions. [2023-08-26 12:51:44,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 95 transitions, 617 flow [2023-08-26 12:51:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 12:51:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 12:51:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 977 transitions. [2023-08-26 12:51:44,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42552264808362367 [2023-08-26 12:51:44,582 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 977 transitions. [2023-08-26 12:51:44,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 977 transitions. [2023-08-26 12:51:44,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:51:44,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 977 transitions. [2023-08-26 12:51:44,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 69.78571428571429) internal successors, (977), 14 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:51:44,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 164.0) internal successors, (2460), 15 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:51:44,591 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 164.0) internal successors, (2460), 15 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:51:44,591 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 103 flow. Second operand 14 states and 977 transitions. [2023-08-26 12:51:44,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 95 transitions, 617 flow [2023-08-26 12:51:44,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 95 transitions, 606 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 12:51:44,600 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 339 flow [2023-08-26 12:51:44,600 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=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=339, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-26 12:51:44,601 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2023-08-26 12:51:44,601 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 339 flow [2023-08-26 12:51:44,601 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 12:51:44,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:51:44,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:51:44,610 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 12:51:44,807 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 12:51:44,808 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 12:51:44,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:51:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1491328013, now seen corresponding path program 2 times [2023-08-26 12:51:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:51:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734209784] [2023-08-26 12:51:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:51:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:51:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:51:45,203 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 12:51:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:51:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734209784] [2023-08-26 12:51:45,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734209784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:51:45,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225851681] [2023-08-26 12:51:45,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 12:51:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:51:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:51:45,209 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 12:51:45,213 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 12:51:45,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 12:51:45,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:51:45,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 12:51:45,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:52:26,682 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 12:52:26,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:52:44,823 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 12:52:44,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225851681] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:52:44,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:52:44,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2023-08-26 12:52:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58926183] [2023-08-26 12:52:44,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:52:44,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 12:52:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:52:44,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 12:52:44,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=170, Unknown=21, NotChecked=0, Total=240 [2023-08-26 12:52:44,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:52:44,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 339 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 12:52:44,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:52:44,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:52:44,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:52:49,765 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 12:52:56,736 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 12:53:08,133 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 12:53:11,071 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 12:53:22,433 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 12:53:24,449 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 12:53:26,460 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 12:53:28,471 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 12:53:31,610 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 12:53:33,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:53:35,799 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 12:53:38,576 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_~x1~0 4294967296))) (.cse5 (* (div c_~x2~0 4294967296) 4294967296)) (.cse1 (div (* (- 1) c_~x2~0) 2))) (and (= (mod c_~x2~0 2) 0) (< .cse0 c_~x1~0) (= (+ c_~x1~0 .cse1 (* (div (* (- 1) .cse1) 4294967296) 4294967296)) .cse0) (let ((.cse2 (+ (mod c_~x2~0 4294967296) 1))) (or (< (* (mod c_~x2~0 2147483648) 2) .cse2) (let ((.cse4 (* (div c_~x1~0 2147483648) 2147483648)) (.cse3 (+ (* (div c_~x2~0 2147483648) 2147483648) c_~x1~0))) (and (< .cse3 (+ .cse4 c_~x2~0 1)) (<= (+ .cse4 c_~x2~0) .cse3))) (< (* 2 (mod c_~x1~0 2147483648)) .cse2))) (<= (+ .cse0 c_~n~0 .cse5) (+ (* c_~x1~0 3) (* (div (+ c_~x2~0 (* (- 2) c_~x1~0)) 4294967296) 4294967296) (* 4294967296 (div c_~n~0 4294967296)))) (<= (+ .cse0 c_~x2~0) (+ (* c_~x1~0 2) (* (div (+ (* (- 1) c_~x1~0) 4294967295) 4294967296) 4294967296) .cse5)) (< (mod (* .cse1 4294967295) 4294967296) (mod c_~n~0 4294967296)))) is different from false [2023-08-26 12:53:40,739 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 12:53:50,417 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 12:53:53,175 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 12:54:04,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:54:06,712 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 12:54:08,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:54:11,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 12:54:13,228 INFO L124 PetriNetUnfolderBase]: 226/442 cut-off events. [2023-08-26 12:54:13,228 INFO L125 PetriNetUnfolderBase]: For 2294/2294 co-relation queries the response was YES. [2023-08-26 12:54:13,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 442 events. 226/442 cut-off events. For 2294/2294 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1947 event pairs, 30 based on Foata normal form. 5/447 useless extension candidates. Maximal degree in co-relation 2312. Up to 225 conditions per place. [2023-08-26 12:54:13,232 INFO L140 encePairwiseOnDemand]: 154/164 looper letters, 89 selfloop transitions, 41 changer transitions 14/144 dead transitions. [2023-08-26 12:54:13,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 144 transitions, 1322 flow [2023-08-26 12:54:13,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 12:54:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 12:54:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1448 transitions. [2023-08-26 12:54:13,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42044134727061555 [2023-08-26 12:54:13,237 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1448 transitions. [2023-08-26 12:54:13,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1448 transitions. [2023-08-26 12:54:13,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:54:13,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1448 transitions. [2023-08-26 12:54:13,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 68.95238095238095) internal successors, (1448), 21 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:54:13,245 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 12:54:13,246 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 12:54:13,246 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 339 flow. Second operand 21 states and 1448 transitions. [2023-08-26 12:54:13,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 144 transitions, 1322 flow [2023-08-26 12:54:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 144 transitions, 1183 flow, removed 68 selfloop flow, removed 2 redundant places. [2023-08-26 12:54:13,255 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 785 flow [2023-08-26 12:54:13,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=785, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2023-08-26 12:54:13,256 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 52 predicate places. [2023-08-26 12:54:13,256 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 785 flow [2023-08-26 12:54:13,257 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 12:54:13,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:54:13,257 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:54:13,267 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 12:54:13,462 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 12:54:13,463 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 12:54:13,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:54:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1095559347, now seen corresponding path program 3 times [2023-08-26 12:54:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:54:13,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045003786] [2023-08-26 12:54:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:54:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:54:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:54:13,610 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 12:54:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:54:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045003786] [2023-08-26 12:54:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045003786] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:54:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77376903] [2023-08-26 12:54:13,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 12:54:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:54:13,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:54:13,612 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 12:54:13,617 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 12:54:19,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 12:54:19,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:54:19,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 12:54:19,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:54:40,254 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 12:54:40,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:54:45,528 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 12:54:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77376903] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:54:45,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:54:45,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-26 12:54:45,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566156684] [2023-08-26 12:54:45,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:54:45,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 12:54:45,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:54:45,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 12:54:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=146, Unknown=2, NotChecked=0, Total=210 [2023-08-26 12:54:45,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:54:45,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 785 flow. Second operand has 15 states, 15 states have (on average 65.13333333333334) internal successors, (977), 15 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:54:45,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:54:45,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:54:45,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:54:55,756 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 12:54:58,734 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 12:55:00,800 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 12:55:02,807 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 12:55:14,056 INFO L124 PetriNetUnfolderBase]: 500/920 cut-off events. [2023-08-26 12:55:14,057 INFO L125 PetriNetUnfolderBase]: For 9665/9665 co-relation queries the response was YES. [2023-08-26 12:55:14,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5817 conditions, 920 events. 500/920 cut-off events. For 9665/9665 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4616 event pairs, 8 based on Foata normal form. 29/949 useless extension candidates. Maximal degree in co-relation 5786. Up to 310 conditions per place. [2023-08-26 12:55:14,066 INFO L140 encePairwiseOnDemand]: 158/164 looper letters, 140 selfloop transitions, 88 changer transitions 49/277 dead transitions. [2023-08-26 12:55:14,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 277 transitions, 3319 flow [2023-08-26 12:55:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-26 12:55:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-26 12:55:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1815 transitions. [2023-08-26 12:55:14,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42565666041275796 [2023-08-26 12:55:14,072 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1815 transitions. [2023-08-26 12:55:14,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1815 transitions. [2023-08-26 12:55:14,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:55:14,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1815 transitions. [2023-08-26 12:55:14,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 69.8076923076923) internal successors, (1815), 26 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:55:14,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 164.0) internal successors, (4428), 27 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:55:14,083 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 164.0) internal successors, (4428), 27 states have internal predecessors, (4428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:55:14,083 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 785 flow. Second operand 26 states and 1815 transitions. [2023-08-26 12:55:14,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 277 transitions, 3319 flow [2023-08-26 12:55:14,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 277 transitions, 2940 flow, removed 185 selfloop flow, removed 4 redundant places. [2023-08-26 12:55:14,113 INFO L231 Difference]: Finished difference. Result has 107 places, 148 transitions, 1345 flow [2023-08-26 12:55:14,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1345, PETRI_PLACES=107, PETRI_TRANSITIONS=148} [2023-08-26 12:55:14,114 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 81 predicate places. [2023-08-26 12:55:14,114 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 148 transitions, 1345 flow [2023-08-26 12:55:14,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 65.13333333333334) internal successors, (977), 15 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:55:14,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:55:14,115 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:55:14,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-26 12:55:14,321 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 12:55:14,322 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 12:55:14,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:55:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash 192582397, now seen corresponding path program 4 times [2023-08-26 12:55:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:55:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181949233] [2023-08-26 12:55:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:55:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:55:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:55:14,490 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 12:55:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:55:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181949233] [2023-08-26 12:55:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181949233] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:55:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642316496] [2023-08-26 12:55:14,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 12:55:14,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:55:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:55:14,493 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 12:55:14,498 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 12:55:14,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 12:55:14,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:55:14,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 12:55:14,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:55:47,515 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~n~0 4294967296)) (.cse1 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse2 (div c_~x2~0 2))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (< .cse1 .cse0) (< (mod .cse2 4294967296) .cse0) (= (mod c_~x1~0 2) 0) (= .cse1 (mod (div c_~x2~0 4) 4294967296)) (= (mod .cse2 2) 0))) is different from false [2023-08-26 12:56:14,823 WARN L234 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 729] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-08-26 12:56:14,824 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 12:56:14,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:56:35,572 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 12:56:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642316496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:56:35,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:56:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-26 12:56:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714180959] [2023-08-26 12:56:35,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:56:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 12:56:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:56:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 12:56:35,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=145, Unknown=15, NotChecked=26, Total=240 [2023-08-26 12:56:35,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:56:35,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 148 transitions, 1345 flow. Second operand has 16 states, 16 states have (on average 65.4375) internal successors, (1047), 16 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:56:35,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:56:35,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:56:35,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:56:38,112 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 12:56:40,116 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 12:56:44,309 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 12:56:47,343 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 12:56:49,346 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 12:56:51,355 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 12:56:53,359 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 12:56:55,374 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 12:56:57,386 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 12:56:59,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 12:57:01,151 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 12:57:03,155 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 12:57:05,159 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 12:57:07,163 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 12:57:14,744 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 12:57:16,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:57:18,781 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 12:57:20,787 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 12:57:30,050 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 12:57:32,515 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 12:57:34,799 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 12:57:48,852 WARN L234 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 12:57:50,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 12:57:52,634 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 12:57:54,739 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 12:57:57,630 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 12:57:59,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:58:01,653 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 12:58:03,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:58:05,676 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 12:58:07,982 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 12:58:15,814 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 12:58:17,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 12:58:19,822 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 12:58:21,827 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 12:58:23,839 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 12:58:26,160 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 12:58:28,172 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 12:58:30,175 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 12:58:32,178 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 12:58:34,184 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 12:58:36,791 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 12:58:45,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:58:46,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 12:58:48,703 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 12:58:53,538 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 12:58:53,665 INFO L124 PetriNetUnfolderBase]: 473/986 cut-off events. [2023-08-26 12:58:53,665 INFO L125 PetriNetUnfolderBase]: For 12608/12608 co-relation queries the response was YES. [2023-08-26 12:58:53,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6147 conditions, 986 events. 473/986 cut-off events. For 12608/12608 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5706 event pairs, 10 based on Foata normal form. 16/1002 useless extension candidates. Maximal degree in co-relation 6109. Up to 314 conditions per place. [2023-08-26 12:58:53,672 INFO L140 encePairwiseOnDemand]: 157/164 looper letters, 156 selfloop transitions, 131 changer transitions 18/305 dead transitions. [2023-08-26 12:58:53,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 305 transitions, 3610 flow [2023-08-26 12:58:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 12:58:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 12:58:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1873 transitions. [2023-08-26 12:58:53,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42299006323396565 [2023-08-26 12:58:53,676 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1873 transitions. [2023-08-26 12:58:53,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1873 transitions. [2023-08-26 12:58:53,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:58:53,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1873 transitions. [2023-08-26 12:58:53,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 69.37037037037037) internal successors, (1873), 27 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:58:53,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 164.0) internal successors, (4592), 28 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:58:53,687 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 164.0) internal successors, (4592), 28 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:58:53,687 INFO L175 Difference]: Start difference. First operand has 107 places, 148 transitions, 1345 flow. Second operand 27 states and 1873 transitions. [2023-08-26 12:58:53,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 305 transitions, 3610 flow [2023-08-26 12:58:53,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 305 transitions, 3146 flow, removed 180 selfloop flow, removed 11 redundant places. [2023-08-26 12:58:53,727 INFO L231 Difference]: Finished difference. Result has 130 places, 197 transitions, 1903 flow [2023-08-26 12:58:53,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1903, PETRI_PLACES=130, PETRI_TRANSITIONS=197} [2023-08-26 12:58:53,728 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 104 predicate places. [2023-08-26 12:58:53,728 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 197 transitions, 1903 flow [2023-08-26 12:58:53,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 65.4375) internal successors, (1047), 16 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:58:53,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:58:53,729 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:58:53,737 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 12:58:53,933 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 12:58:53,933 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 12:58:53,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:58:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1443717581, now seen corresponding path program 5 times [2023-08-26 12:58:53,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:58:53,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184956770] [2023-08-26 12:58:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:58:53,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:58:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:58:54,154 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 12:58:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:58:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184956770] [2023-08-26 12:58:54,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184956770] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 12:58:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801037461] [2023-08-26 12:58:54,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 12:58:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 12:58:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:58:54,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 12:58:54,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 12:59:06,522 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-26 12:59:06,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 12:59:06,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 12:59:06,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 12:59:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:59:22,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 12:59:31,234 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 12:59:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801037461] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 12:59:31,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 12:59:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-26 12:59:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105385791] [2023-08-26 12:59:31,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 12:59:31,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 12:59:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:59:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 12:59:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=151, Unknown=3, NotChecked=0, Total=210 [2023-08-26 12:59:31,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 12:59:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 197 transitions, 1903 flow. Second operand has 15 states, 15 states have (on average 65.13333333333334) internal successors, (977), 15 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:59:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:59:31,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 12:59:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:59:33,391 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 12:59:40,098 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 12:59:42,103 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 12:59:44,108 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 12:59:46,116 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 12:59:48,327 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 12:59:50,341 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 13:00:01,235 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 13:00:03,271 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 13:00:05,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 13:00:16,774 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 13:00:17,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:00:19,796 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 13:00:21,803 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 13:00:23,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:00:25,826 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 13:00:27,832 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 13:00:29,837 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 13:00:32,074 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 13:00:34,212 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 13:00:39,433 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 13:00:41,437 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 13:00:43,211 INFO L124 PetriNetUnfolderBase]: 504/1013 cut-off events. [2023-08-26 13:00:43,211 INFO L125 PetriNetUnfolderBase]: For 16669/16669 co-relation queries the response was YES. [2023-08-26 13:00:43,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6640 conditions, 1013 events. 504/1013 cut-off events. For 16669/16669 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5767 event pairs, 10 based on Foata normal form. 27/1040 useless extension candidates. Maximal degree in co-relation 6596. Up to 496 conditions per place. [2023-08-26 13:00:43,221 INFO L140 encePairwiseOnDemand]: 157/164 looper letters, 149 selfloop transitions, 68 changer transitions 31/248 dead transitions. [2023-08-26 13:00:43,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 248 transitions, 3048 flow [2023-08-26 13:00:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 13:00:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 13:00:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1163 transitions. [2023-08-26 13:00:43,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171449067431851 [2023-08-26 13:00:43,224 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1163 transitions. [2023-08-26 13:00:43,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1163 transitions. [2023-08-26 13:00:43,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:00:43,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1163 transitions. [2023-08-26 13:00:43,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 68.41176470588235) internal successors, (1163), 17 states have internal predecessors, (1163), 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 13:00:43,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 164.0) internal successors, (2952), 18 states have internal predecessors, (2952), 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 13:00:43,234 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 164.0) internal successors, (2952), 18 states have internal predecessors, (2952), 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 13:00:43,234 INFO L175 Difference]: Start difference. First operand has 130 places, 197 transitions, 1903 flow. Second operand 17 states and 1163 transitions. [2023-08-26 13:00:43,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 248 transitions, 3048 flow [2023-08-26 13:00:43,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 248 transitions, 2876 flow, removed 62 selfloop flow, removed 8 redundant places. [2023-08-26 13:00:43,288 INFO L231 Difference]: Finished difference. Result has 144 places, 184 transitions, 1771 flow [2023-08-26 13:00:43,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1771, PETRI_PLACES=144, PETRI_TRANSITIONS=184} [2023-08-26 13:00:43,289 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 118 predicate places. [2023-08-26 13:00:43,289 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 184 transitions, 1771 flow [2023-08-26 13:00:43,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 65.13333333333334) internal successors, (977), 15 states have internal predecessors, (977), 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 13:00:43,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:00:43,289 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:00:43,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 13:00:43,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:00:43,497 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 13:00:43,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:00:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 169485448, now seen corresponding path program 6 times [2023-08-26 13:00:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:00:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988658963] [2023-08-26 13:00:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:00:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:00:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:00:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:00:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:00:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988658963] [2023-08-26 13:00:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988658963] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 13:00:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322857811] [2023-08-26 13:00:43,980 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 13:00:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:00:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:00:43,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:00:43,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 13:00:45,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-26 13:00:45,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 13:00:45,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 13:00:45,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:01:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:01:01,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:01:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:01:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322857811] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 13:01:19,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 13:01:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-26 13:01:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261804368] [2023-08-26 13:01:19,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 13:01:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-26 13:01:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:01:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-26 13:01:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=275, Unknown=13, NotChecked=0, Total=342 [2023-08-26 13:01:19,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 13:01:19,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 184 transitions, 1771 flow. Second operand has 19 states, 19 states have (on average 65.26315789473684) internal successors, (1240), 19 states have internal predecessors, (1240), 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 13:01:19,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:01:19,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 13:01:19,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:01:25,238 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 13:01:43,846 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 13:01:46,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 13:01:47,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:01:49,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:02:05,568 WARN L234 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 13:02:10,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:02:13,182 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 13:02:14,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:02:16,741 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 13:02:30,098 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 13:02:31,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 13:02:34,033 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 13:02:37,019 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 13:02:40,074 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 13:02:42,078 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 13:02:44,466 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 13:03:05,200 WARN L234 SmtUtils]: Spent 12.25s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 13:03:07,271 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 13:03:09,778 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 13:03:11,796 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 13:03:13,874 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 13:03:23,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:03:25,767 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 13:03:29,558 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 13:03:32,024 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 13:03:34,251 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 13:03:37,338 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 13:03:47,335 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 13:03:49,970 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 13:03:59,745 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 13:04:01,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 13:04:03,759 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 13:04:05,767 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 13:04:07,772 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 13:04:09,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 13:04:11,781 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 13:04:13,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 13:04:15,789 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 13:04:17,792 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 13:04:19,799 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 13:04:21,802 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 13:04:23,806 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 13:04:25,810 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 13:04:27,817 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 13:04:29,836 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 13:04:32,441 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 13:04:34,444 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 13:04:36,470 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 13:04:38,475 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 13:04:40,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:04:42,387 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 13:04:44,395 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 13:04:46,401 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 13:04:48,810 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 13:04:50,892 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 13:04:53,693 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 13:05:05,389 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 13:05:06,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 13:05:08,590 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 13:05:11,226 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 [] Received shutdown request... [2023-08-26 13:05:13,211 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 13:05:13,241 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 13:05:13,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 13:05:14,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 13:05:14,442 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 13:05:14,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 13:05:14,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2023-08-26 13:05:14,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 13:05:14,449 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2023-08-26 13:05:14,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2023-08-26 13:05:14,451 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2023-08-26 13:05:14,451 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:05:14,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 13:05:14,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 13:05:14,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:05:14 BasicIcfg [2023-08-26 13:05:14,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 13:05:14,455 INFO L158 Benchmark]: Toolchain (without parser) took 875754.78ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 309.3MB in the beginning and 284.9MB in the end (delta: 24.4MB). Peak memory consumption was 93.0MB. Max. memory is 16.0GB. [2023-08-26 13:05:14,455 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 333.4MB. Free memory was 311.3MB in the beginning and 311.2MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 13:05:14,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.36ms. Allocated memory is still 333.4MB. Free memory was 309.3MB in the beginning and 298.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 13:05:14,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.53ms. Allocated memory is still 333.4MB. Free memory was 298.5MB in the beginning and 297.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 13:05:14,456 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 333.4MB. Free memory was 297.0MB in the beginning and 295.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 13:05:14,456 INFO L158 Benchmark]: RCFGBuilder took 425.22ms. Allocated memory is still 333.4MB. Free memory was 295.9MB in the beginning and 282.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 13:05:14,456 INFO L158 Benchmark]: TraceAbstraction took 875010.97ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 281.8MB in the beginning and 284.9MB in the end (delta: -3.1MB). Peak memory consumption was 65.7MB. Max. memory is 16.0GB. [2023-08-26 13:05:14,458 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.14ms. Allocated memory is still 333.4MB. Free memory was 311.3MB in the beginning and 311.2MB in the end (delta: 119.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 233.36ms. Allocated memory is still 333.4MB. Free memory was 309.3MB in the beginning and 298.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.53ms. Allocated memory is still 333.4MB. Free memory was 298.5MB in the beginning and 297.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 333.4MB. Free memory was 297.0MB in the beginning and 295.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 425.22ms. Allocated memory is still 333.4MB. Free memory was 295.9MB in the beginning and 282.8MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 875010.97ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 281.8MB in the beginning and 284.9MB in the end (delta: -3.1MB). Peak memory consumption was 65.7MB. 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 executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - 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 executing Executor. - 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 executing Executor. - 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: 874.9s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 600.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 135 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 366.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 642 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 364.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 236 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2745 IncrementalHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 0 mSDtfsCounter, 2745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 116 SyntacticMatches, 17 SemanticMatches, 170 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 390.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1903occurred in iteration=13, InterpolantAutomatonStates: 135, 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, 21.8s SatisfiabilityAnalysisTime, 248.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 8885 SizeOfPredicates, 24 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 15/71 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