/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:42:30,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:42:30,432 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-27 03:42:30,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:42:30,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:42:30,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:42:30,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:42:30,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:42:30,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:42:30,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:42:30,475 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:42:30,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:42:30,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:42:30,477 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:42:30,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:42:30,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:42:30,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:42:30,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:42:30,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:42:30,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:42:30,478 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:42:30,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:42:30,479 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:42:30,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:42:30,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:42:30,480 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:42:30,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:42:30,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:42:30,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:42:30,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:42:30,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:42:30,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:42:30,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:42:30,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:42:30,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:42:30,483 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:42:30,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:42:30,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:42:30,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:42:30,830 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:42:30,830 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:42:30,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-27 03:42:32,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:42:32,379 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:42:32,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.opt.i [2023-08-27 03:42:32,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fa21965/e059d792d802416db310981f5853eafb/FLAGd177288e6 [2023-08-27 03:42:32,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97fa21965/e059d792d802416db310981f5853eafb [2023-08-27 03:42:32,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:42:32,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:42:32,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:42:32,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:42:32,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:42:32,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:32,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9c0476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32, skipping insertion in model container [2023-08-27 03:42:32,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:32,492 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:42:32,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:42:32,869 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:42:32,896 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:42:32,897 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:42:32,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:42:32,982 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:42:32,982 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:42:32,988 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:42:32,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32 WrapperNode [2023-08-27 03:42:32,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:42:32,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:42:32,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:42:32,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:42:32,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,042 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 173 [2023-08-27 03:42:33,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:42:33,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:42:33,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:42:33,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:42:33,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:42:33,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:42:33,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:42:33,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:42:33,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (1/1) ... [2023-08-27 03:42:33,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:42:33,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:42:33,108 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-27 03:42:33,144 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-27 03:42:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:42:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:42:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:42:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:42:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:42:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:42:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:42:33,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:42:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:42:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:42:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:42:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:42:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:42:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:42:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:42:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:42:33,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:42:33,166 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:42:33,327 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:42:33,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:42:33,689 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:42:33,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:42:33,786 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:42:33,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:42:33 BoogieIcfgContainer [2023-08-27 03:42:33,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:42:33,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:42:33,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:42:33,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:42:33,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:42:32" (1/3) ... [2023-08-27 03:42:33,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a0cd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:42:33, skipping insertion in model container [2023-08-27 03:42:33,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:42:32" (2/3) ... [2023-08-27 03:42:33,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a0cd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:42:33, skipping insertion in model container [2023-08-27 03:42:33,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:42:33" (3/3) ... [2023-08-27 03:42:33,795 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.opt.i [2023-08-27 03:42:33,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:42:33,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:42:33,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:42:33,859 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:42:33,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:42:33,934 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:42:33,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-27 03:42:33,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 03:42:33,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-27 03:42:33,948 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:42:33,955 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:42:33,958 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 03:42:33,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-27 03:42:33,987 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 03:42:33,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:33,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-27 03:42:33,990 INFO L119 LiptonReduction]: Number of co-enabled transitions 4034 [2023-08-27 03:42:38,022 INFO L134 LiptonReduction]: Checked pairs total: 14632 [2023-08-27 03:42:38,022 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-27 03:42:38,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:42:38,041 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;@452742db, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:42:38,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:42:38,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:42:38,044 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:42:38,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:42:38,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:38,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:42:38,046 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:38,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 607039597, now seen corresponding path program 1 times [2023-08-27 03:42:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276251069] [2023-08-27 03:42:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:38,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:38,324 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-27 03:42:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:38,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276251069] [2023-08-27 03:42:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276251069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544640585] [2023-08-27 03:42:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:38,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:38,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-08-27 03:42:38,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:38,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:38,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-08-27 03:42:38,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:39,818 INFO L124 PetriNetUnfolderBase]: 9509/13235 cut-off events. [2023-08-27 03:42:39,818 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-27 03:42:39,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26645 conditions, 13235 events. 9509/13235 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 76546 event pairs, 2559 based on Foata normal form. 0/8406 useless extension candidates. Maximal degree in co-relation 26633. Up to 12139 conditions per place. [2023-08-27 03:42:39,932 INFO L140 encePairwiseOnDemand]: 251/265 looper letters, 49 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2023-08-27 03:42:39,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 243 flow [2023-08-27 03:42:39,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-27 03:42:39,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031446540880503 [2023-08-27 03:42:39,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-27 03:42:39,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-27 03:42:39,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:39,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-27 03:42:39,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:39,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:39,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:39,968 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 400 transitions. [2023-08-27 03:42:39,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 243 flow [2023-08-27 03:42:39,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:42:39,975 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 125 flow [2023-08-27 03:42:39,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-27 03:42:39,979 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-27 03:42:39,979 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 125 flow [2023-08-27 03:42:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:39,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:39,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:39,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:42:39,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:39,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1659719223, now seen corresponding path program 1 times [2023-08-27 03:42:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:39,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149576218] [2023-08-27 03:42:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:40,213 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-27 03:42:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:40,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149576218] [2023-08-27 03:42:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149576218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:40,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153607998] [2023-08-27 03:42:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:40,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:40,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:40,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 265 [2023-08-27 03:42:40,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:40,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:40,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 265 [2023-08-27 03:42:40,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:41,129 INFO L124 PetriNetUnfolderBase]: 6528/9786 cut-off events. [2023-08-27 03:42:41,129 INFO L125 PetriNetUnfolderBase]: For 1201/1633 co-relation queries the response was YES. [2023-08-27 03:42:41,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23752 conditions, 9786 events. 6528/9786 cut-off events. For 1201/1633 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 65853 event pairs, 1504 based on Foata normal form. 0/7265 useless extension candidates. Maximal degree in co-relation 23741. Up to 6995 conditions per place. [2023-08-27 03:42:41,208 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 46 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-27 03:42:41,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 274 flow [2023-08-27 03:42:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-27 03:42:41,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49433962264150944 [2023-08-27 03:42:41,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-27 03:42:41,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-27 03:42:41,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:41,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-27 03:42:41,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,215 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 125 flow. Second operand 3 states and 393 transitions. [2023-08-27 03:42:41,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 274 flow [2023-08-27 03:42:41,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:41,218 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 122 flow [2023-08-27 03:42:41,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 03:42:41,221 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2023-08-27 03:42:41,222 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 122 flow [2023-08-27 03:42:41,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:41,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:41,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:42:41,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:41,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 692683541, now seen corresponding path program 1 times [2023-08-27 03:42:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760396858] [2023-08-27 03:42:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:41,303 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-27 03:42:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760396858] [2023-08-27 03:42:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760396858] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:41,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:41,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:41,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668760723] [2023-08-27 03:42:41,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:41,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:41,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:41,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:41,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-08-27 03:42:41,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:41,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:41,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-08-27 03:42:41,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:42,083 INFO L124 PetriNetUnfolderBase]: 4789/6699 cut-off events. [2023-08-27 03:42:42,084 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2023-08-27 03:42:42,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 6699 events. 4789/6699 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 34616 event pairs, 1132 based on Foata normal form. 0/5211 useless extension candidates. Maximal degree in co-relation 16457. Up to 5810 conditions per place. [2023-08-27 03:42:42,137 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 43 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-27 03:42:42,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 244 flow [2023-08-27 03:42:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-27 03:42:42,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2023-08-27 03:42:42,140 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-27 03:42:42,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-27 03:42:42,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:42,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-27 03:42:42,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,144 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,144 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 122 flow. Second operand 4 states and 500 transitions. [2023-08-27 03:42:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 244 flow [2023-08-27 03:42:42,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:42,147 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 112 flow [2023-08-27 03:42:42,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-27 03:42:42,148 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2023-08-27 03:42:42,148 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 112 flow [2023-08-27 03:42:42,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:42,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:42,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:42:42,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:42,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash 437746262, now seen corresponding path program 1 times [2023-08-27 03:42:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889109484] [2023-08-27 03:42:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:42,206 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-27 03:42:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889109484] [2023-08-27 03:42:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889109484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:42,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79485858] [2023-08-27 03:42:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:42,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:42,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:42,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:42,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:42,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-08-27 03:42:42,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:42,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-08-27 03:42:42,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:42,679 INFO L124 PetriNetUnfolderBase]: 2967/4214 cut-off events. [2023-08-27 03:42:42,679 INFO L125 PetriNetUnfolderBase]: For 1194/1194 co-relation queries the response was YES. [2023-08-27 03:42:42,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 4214 events. 2967/4214 cut-off events. For 1194/1194 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20019 event pairs, 638 based on Foata normal form. 0/3725 useless extension candidates. Maximal degree in co-relation 10315. Up to 1818 conditions per place. [2023-08-27 03:42:42,699 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-27 03:42:42,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 336 flow [2023-08-27 03:42:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-27 03:42:42,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48962264150943396 [2023-08-27 03:42:42,702 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-27 03:42:42,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-27 03:42:42,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:42,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-27 03:42:42,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,706 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,706 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 112 flow. Second operand 4 states and 519 transitions. [2023-08-27 03:42:42,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 336 flow [2023-08-27 03:42:42,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:42,708 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 164 flow [2023-08-27 03:42:42,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-27 03:42:42,709 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2023-08-27 03:42:42,709 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 164 flow [2023-08-27 03:42:42,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:42,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:42,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:42:42,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:42,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1557232953, now seen corresponding path program 1 times [2023-08-27 03:42:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878653762] [2023-08-27 03:42:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:42,875 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-27 03:42:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878653762] [2023-08-27 03:42:42,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878653762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:42:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385286058] [2023-08-27 03:42:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:42,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:42:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:42,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:42:42,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:42:42,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:42,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:42,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:42,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:42,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:43,917 INFO L124 PetriNetUnfolderBase]: 9385/13134 cut-off events. [2023-08-27 03:42:43,917 INFO L125 PetriNetUnfolderBase]: For 10252/10252 co-relation queries the response was YES. [2023-08-27 03:42:43,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36947 conditions, 13134 events. 9385/13134 cut-off events. For 10252/10252 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 68158 event pairs, 3039 based on Foata normal form. 0/12146 useless extension candidates. Maximal degree in co-relation 36934. Up to 8709 conditions per place. [2023-08-27 03:42:43,992 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 65 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2023-08-27 03:42:43,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 73 transitions, 462 flow [2023-08-27 03:42:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:42:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:42:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-27 03:42:43,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48050314465408805 [2023-08-27 03:42:43,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-27 03:42:43,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-27 03:42:43,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:43,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-27 03:42:43,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:43,997 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 164 flow. Second operand 3 states and 382 transitions. [2023-08-27 03:42:43,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 73 transitions, 462 flow [2023-08-27 03:42:44,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 428 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:44,006 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 208 flow [2023-08-27 03:42:44,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-27 03:42:44,007 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2023-08-27 03:42:44,007 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 208 flow [2023-08-27 03:42:44,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:44,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:44,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:42:44,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:44,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1029582432, now seen corresponding path program 1 times [2023-08-27 03:42:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243584149] [2023-08-27 03:42:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:44,128 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-27 03:42:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:44,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243584149] [2023-08-27 03:42:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243584149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:44,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566826599] [2023-08-27 03:42:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:44,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:44,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:44,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:44,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:44,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:45,032 INFO L124 PetriNetUnfolderBase]: 8903/12472 cut-off events. [2023-08-27 03:42:45,032 INFO L125 PetriNetUnfolderBase]: For 9686/9686 co-relation queries the response was YES. [2023-08-27 03:42:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39730 conditions, 12472 events. 8903/12472 cut-off events. For 9686/9686 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 63545 event pairs, 2067 based on Foata normal form. 118/12034 useless extension candidates. Maximal degree in co-relation 39715. Up to 6100 conditions per place. [2023-08-27 03:42:45,118 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 83 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-27 03:42:45,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 621 flow [2023-08-27 03:42:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-08-27 03:42:45,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688679245283019 [2023-08-27 03:42:45,120 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-08-27 03:42:45,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-08-27 03:42:45,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:45,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-08-27 03:42:45,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:45,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:45,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:45,124 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 208 flow. Second operand 4 states and 497 transitions. [2023-08-27 03:42:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 621 flow [2023-08-27 03:42:45,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:45,164 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 260 flow [2023-08-27 03:42:45,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-27 03:42:45,165 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2023-08-27 03:42:45,165 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 260 flow [2023-08-27 03:42:45,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:45,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:45,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:45,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:42:45,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:45,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1904283253, now seen corresponding path program 1 times [2023-08-27 03:42:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219491135] [2023-08-27 03:42:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:45,334 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-27 03:42:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219491135] [2023-08-27 03:42:45,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219491135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:45,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:45,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:42:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065956396] [2023-08-27 03:42:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:45,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:45,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:45,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 260 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:45,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:45,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:46,361 INFO L124 PetriNetUnfolderBase]: 8724/12226 cut-off events. [2023-08-27 03:42:46,361 INFO L125 PetriNetUnfolderBase]: For 12938/12938 co-relation queries the response was YES. [2023-08-27 03:42:46,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41240 conditions, 12226 events. 8724/12226 cut-off events. For 12938/12938 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 62777 event pairs, 1318 based on Foata normal form. 32/11705 useless extension candidates. Maximal degree in co-relation 41222. Up to 7505 conditions per place. [2023-08-27 03:42:46,437 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 87 selfloop transitions, 19 changer transitions 0/106 dead transitions. [2023-08-27 03:42:46,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 106 transitions, 734 flow [2023-08-27 03:42:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-27 03:42:46,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47735849056603774 [2023-08-27 03:42:46,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-27 03:42:46,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-27 03:42:46,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:46,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-27 03:42:46,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:46,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:46,443 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:46,443 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 260 flow. Second operand 4 states and 506 transitions. [2023-08-27 03:42:46,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 106 transitions, 734 flow [2023-08-27 03:42:46,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:46,478 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 430 flow [2023-08-27 03:42:46,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2023-08-27 03:42:46,479 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-27 03:42:46,479 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 430 flow [2023-08-27 03:42:46,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:46,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:46,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:46,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:42:46,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:46,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1096817816, now seen corresponding path program 1 times [2023-08-27 03:42:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916717339] [2023-08-27 03:42:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:46,630 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-27 03:42:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916717339] [2023-08-27 03:42:46,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916717339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:46,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:46,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066300846] [2023-08-27 03:42:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:46,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:46,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:46,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:46,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:46,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:46,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:46,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:47,402 INFO L124 PetriNetUnfolderBase]: 5967/8997 cut-off events. [2023-08-27 03:42:47,402 INFO L125 PetriNetUnfolderBase]: For 17478/18475 co-relation queries the response was YES. [2023-08-27 03:42:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32064 conditions, 8997 events. 5967/8997 cut-off events. For 17478/18475 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 54124 event pairs, 1128 based on Foata normal form. 986/9127 useless extension candidates. Maximal degree in co-relation 32042. Up to 6536 conditions per place. [2023-08-27 03:42:47,457 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 104 selfloop transitions, 10 changer transitions 0/128 dead transitions. [2023-08-27 03:42:47,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 128 transitions, 1072 flow [2023-08-27 03:42:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:42:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:42:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-08-27 03:42:47,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46264150943396226 [2023-08-27 03:42:47,465 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-08-27 03:42:47,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-08-27 03:42:47,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:47,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-08-27 03:42:47,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,469 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,469 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 430 flow. Second operand 5 states and 613 transitions. [2023-08-27 03:42:47,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 128 transitions, 1072 flow [2023-08-27 03:42:47,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 128 transitions, 1072 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:42:47,501 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 501 flow [2023-08-27 03:42:47,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=501, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2023-08-27 03:42:47,502 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-27 03:42:47,502 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 67 transitions, 501 flow [2023-08-27 03:42:47,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:47,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:47,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:42:47,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:47,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:47,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1777411903, now seen corresponding path program 1 times [2023-08-27 03:42:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173836413] [2023-08-27 03:42:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:47,560 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-27 03:42:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:47,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173836413] [2023-08-27 03:42:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173836413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:47,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:47,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746575018] [2023-08-27 03:42:47,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:47,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:47,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:47,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-08-27 03:42:47,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 67 transitions, 501 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:47,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:47,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-08-27 03:42:47,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:48,254 INFO L124 PetriNetUnfolderBase]: 5107/7607 cut-off events. [2023-08-27 03:42:48,254 INFO L125 PetriNetUnfolderBase]: For 18578/19490 co-relation queries the response was YES. [2023-08-27 03:42:48,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28922 conditions, 7607 events. 5107/7607 cut-off events. For 18578/19490 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 44608 event pairs, 459 based on Foata normal form. 436/7792 useless extension candidates. Maximal degree in co-relation 28895. Up to 3139 conditions per place. [2023-08-27 03:42:48,291 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 104 selfloop transitions, 17 changer transitions 0/135 dead transitions. [2023-08-27 03:42:48,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 135 transitions, 1168 flow [2023-08-27 03:42:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:42:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:42:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-27 03:42:48,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867924528301887 [2023-08-27 03:42:48,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-27 03:42:48,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-27 03:42:48,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:48,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-27 03:42:48,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,298 INFO L175 Difference]: Start difference. First operand has 64 places, 67 transitions, 501 flow. Second operand 5 states and 645 transitions. [2023-08-27 03:42:48,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 135 transitions, 1168 flow [2023-08-27 03:42:48,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 135 transitions, 1154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:42:48,335 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 569 flow [2023-08-27 03:42:48,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=569, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-27 03:42:48,336 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2023-08-27 03:42:48,336 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 569 flow [2023-08-27 03:42:48,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:48,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:48,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:42:48,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:48,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 995422923, now seen corresponding path program 1 times [2023-08-27 03:42:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129800591] [2023-08-27 03:42:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:48,524 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-27 03:42:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:48,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129800591] [2023-08-27 03:42:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129800591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:48,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287381971] [2023-08-27 03:42:48,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:48,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:48,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:48,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:48,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:48,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 569 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:48,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:48,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:48,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:49,602 INFO L124 PetriNetUnfolderBase]: 8026/11721 cut-off events. [2023-08-27 03:42:49,603 INFO L125 PetriNetUnfolderBase]: For 36799/36799 co-relation queries the response was YES. [2023-08-27 03:42:49,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49665 conditions, 11721 events. 8026/11721 cut-off events. For 36799/36799 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 65489 event pairs, 1637 based on Foata normal form. 105/11750 useless extension candidates. Maximal degree in co-relation 49637. Up to 5843 conditions per place. [2023-08-27 03:42:49,673 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 114 selfloop transitions, 26 changer transitions 4/144 dead transitions. [2023-08-27 03:42:49,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1375 flow [2023-08-27 03:42:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:42:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:42:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-08-27 03:42:49,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820754716981132 [2023-08-27 03:42:49,676 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-08-27 03:42:49,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-08-27 03:42:49,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:49,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-08-27 03:42:49,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:49,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:49,679 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:49,680 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 569 flow. Second operand 4 states and 511 transitions. [2023-08-27 03:42:49,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1375 flow [2023-08-27 03:42:49,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 144 transitions, 1269 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-08-27 03:42:49,903 INFO L231 Difference]: Finished difference. Result has 70 places, 79 transitions, 738 flow [2023-08-27 03:42:49,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=738, PETRI_PLACES=70, PETRI_TRANSITIONS=79} [2023-08-27 03:42:49,903 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2023-08-27 03:42:49,904 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 738 flow [2023-08-27 03:42:49,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:49,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:49,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:49,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:42:49,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:49,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1460750585, now seen corresponding path program 1 times [2023-08-27 03:42:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778165542] [2023-08-27 03:42:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:50,147 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-27 03:42:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778165542] [2023-08-27 03:42:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778165542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:42:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974215726] [2023-08-27 03:42:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:50,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:50,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 738 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:50,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:50,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:50,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:50,983 INFO L124 PetriNetUnfolderBase]: 4546/7172 cut-off events. [2023-08-27 03:42:50,983 INFO L125 PetriNetUnfolderBase]: For 22592/23440 co-relation queries the response was YES. [2023-08-27 03:42:51,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28832 conditions, 7172 events. 4546/7172 cut-off events. For 22592/23440 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 45340 event pairs, 388 based on Foata normal form. 768/7699 useless extension candidates. Maximal degree in co-relation 28801. Up to 2585 conditions per place. [2023-08-27 03:42:51,020 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 132 selfloop transitions, 19 changer transitions 4/170 dead transitions. [2023-08-27 03:42:51,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 170 transitions, 1703 flow [2023-08-27 03:42:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:42:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:42:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-27 03:42:51,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461455525606469 [2023-08-27 03:42:51,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-27 03:42:51,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-27 03:42:51,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:51,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-27 03:42:51,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,028 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,028 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 738 flow. Second operand 7 states and 856 transitions. [2023-08-27 03:42:51,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 170 transitions, 1703 flow [2023-08-27 03:42:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 170 transitions, 1687 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-27 03:42:51,148 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 786 flow [2023-08-27 03:42:51,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=786, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2023-08-27 03:42:51,148 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2023-08-27 03:42:51,148 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 786 flow [2023-08-27 03:42:51,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:51,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:51,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:42:51,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:51,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash -35707931, now seen corresponding path program 1 times [2023-08-27 03:42:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388545788] [2023-08-27 03:42:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:51,343 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-27 03:42:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388545788] [2023-08-27 03:42:51,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388545788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:51,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:51,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:42:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508268297] [2023-08-27 03:42:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:51,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:42:51,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:51,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:42:51,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:42:51,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:51,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 786 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:51,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:51,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:52,187 INFO L124 PetriNetUnfolderBase]: 3821/6066 cut-off events. [2023-08-27 03:42:52,187 INFO L125 PetriNetUnfolderBase]: For 24165/25006 co-relation queries the response was YES. [2023-08-27 03:42:52,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27369 conditions, 6066 events. 3821/6066 cut-off events. For 24165/25006 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 38076 event pairs, 266 based on Foata normal form. 510/6360 useless extension candidates. Maximal degree in co-relation 27333. Up to 1502 conditions per place. [2023-08-27 03:42:52,225 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 143 selfloop transitions, 28 changer transitions 4/189 dead transitions. [2023-08-27 03:42:52,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 189 transitions, 1887 flow [2023-08-27 03:42:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:42:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:42:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1097 transitions. [2023-08-27 03:42:52,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459958071278826 [2023-08-27 03:42:52,230 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1097 transitions. [2023-08-27 03:42:52,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1097 transitions. [2023-08-27 03:42:52,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:52,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1097 transitions. [2023-08-27 03:42:52,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.88888888888889) internal successors, (1097), 9 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:52,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:52,237 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:52,237 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 786 flow. Second operand 9 states and 1097 transitions. [2023-08-27 03:42:52,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 189 transitions, 1887 flow [2023-08-27 03:42:52,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 189 transitions, 1793 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 03:42:52,463 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 777 flow [2023-08-27 03:42:52,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2023-08-27 03:42:52,464 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2023-08-27 03:42:52,464 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 777 flow [2023-08-27 03:42:52,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:52,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:52,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:52,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:42:52,465 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:52,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 4427039, now seen corresponding path program 1 times [2023-08-27 03:42:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969198293] [2023-08-27 03:42:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:52,565 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-27 03:42:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969198293] [2023-08-27 03:42:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969198293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:42:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12067803] [2023-08-27 03:42:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:42:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:42:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:42:52,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-08-27 03:42:52,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 777 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:52,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:52,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-08-27 03:42:52,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:53,232 INFO L124 PetriNetUnfolderBase]: 3729/5894 cut-off events. [2023-08-27 03:42:53,232 INFO L125 PetriNetUnfolderBase]: For 23459/24107 co-relation queries the response was YES. [2023-08-27 03:42:53,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28286 conditions, 5894 events. 3729/5894 cut-off events. For 23459/24107 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 36589 event pairs, 486 based on Foata normal form. 226/5999 useless extension candidates. Maximal degree in co-relation 28248. Up to 2123 conditions per place. [2023-08-27 03:42:53,259 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 71 selfloop transitions, 26 changer transitions 24/132 dead transitions. [2023-08-27 03:42:53,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 132 transitions, 1342 flow [2023-08-27 03:42:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:42:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:42:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-27 03:42:53,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47232704402515724 [2023-08-27 03:42:53,262 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-27 03:42:53,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-27 03:42:53,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:53,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-27 03:42:53,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,267 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,267 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 777 flow. Second operand 6 states and 751 transitions. [2023-08-27 03:42:53,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 132 transitions, 1342 flow [2023-08-27 03:42:53,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 132 transitions, 1288 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:42:53,606 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 567 flow [2023-08-27 03:42:53,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2023-08-27 03:42:53,607 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2023-08-27 03:42:53,607 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 567 flow [2023-08-27 03:42:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:53,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:53,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:42:53,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:53,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 301039055, now seen corresponding path program 1 times [2023-08-27 03:42:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021404070] [2023-08-27 03:42:53,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:53,823 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-27 03:42:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021404070] [2023-08-27 03:42:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021404070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:53,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:42:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438436289] [2023-08-27 03:42:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:53,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:53,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2023-08-27 03:42:53,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:53,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:53,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2023-08-27 03:42:53,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:54,718 INFO L124 PetriNetUnfolderBase]: 5619/8896 cut-off events. [2023-08-27 03:42:54,719 INFO L125 PetriNetUnfolderBase]: For 44129/44129 co-relation queries the response was YES. [2023-08-27 03:42:54,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43565 conditions, 8896 events. 5619/8896 cut-off events. For 44129/44129 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 55872 event pairs, 1076 based on Foata normal form. 9/8905 useless extension candidates. Maximal degree in co-relation 43527. Up to 3446 conditions per place. [2023-08-27 03:42:54,748 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 87 selfloop transitions, 15 changer transitions 93/195 dead transitions. [2023-08-27 03:42:54,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 195 transitions, 2029 flow [2023-08-27 03:42:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:42:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:42:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-08-27 03:42:54,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4578616352201258 [2023-08-27 03:42:54,751 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-08-27 03:42:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-08-27 03:42:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:54,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-08-27 03:42:54,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:54,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:54,755 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:54,756 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 567 flow. Second operand 6 states and 728 transitions. [2023-08-27 03:42:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 195 transitions, 2029 flow [2023-08-27 03:42:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 195 transitions, 1570 flow, removed 50 selfloop flow, removed 12 redundant places. [2023-08-27 03:42:55,044 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 347 flow [2023-08-27 03:42:55,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2023-08-27 03:42:55,045 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2023-08-27 03:42:55,045 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 51 transitions, 347 flow [2023-08-27 03:42:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:55,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:42:55,045 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:55,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash -930065435, now seen corresponding path program 2 times [2023-08-27 03:42:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:55,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155166075] [2023-08-27 03:42:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:55,238 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-27 03:42:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155166075] [2023-08-27 03:42:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155166075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:42:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521439305] [2023-08-27 03:42:55,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:55,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:42:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:42:55,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:42:55,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 265 [2023-08-27 03:42:55,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 51 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:55,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 265 [2023-08-27 03:42:55,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:55,593 INFO L124 PetriNetUnfolderBase]: 1374/2277 cut-off events. [2023-08-27 03:42:55,594 INFO L125 PetriNetUnfolderBase]: For 4992/5123 co-relation queries the response was YES. [2023-08-27 03:42:55,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8535 conditions, 2277 events. 1374/2277 cut-off events. For 4992/5123 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12526 event pairs, 224 based on Foata normal form. 135/2345 useless extension candidates. Maximal degree in co-relation 8503. Up to 818 conditions per place. [2023-08-27 03:42:55,604 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 58 selfloop transitions, 17 changer transitions 25/106 dead transitions. [2023-08-27 03:42:55,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 106 transitions, 833 flow [2023-08-27 03:42:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:42:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:42:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 945 transitions. [2023-08-27 03:42:55,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44575471698113206 [2023-08-27 03:42:55,607 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 945 transitions. [2023-08-27 03:42:55,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 945 transitions. [2023-08-27 03:42:55,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:55,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 945 transitions. [2023-08-27 03:42:55,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,613 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,613 INFO L175 Difference]: Start difference. First operand has 74 places, 51 transitions, 347 flow. Second operand 8 states and 945 transitions. [2023-08-27 03:42:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 106 transitions, 833 flow [2023-08-27 03:42:55,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 808 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-27 03:42:55,647 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 317 flow [2023-08-27 03:42:55,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2023-08-27 03:42:55,648 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2023-08-27 03:42:55,649 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 317 flow [2023-08-27 03:42:55,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:55,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:55,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:42:55,649 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:55,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1035024833, now seen corresponding path program 1 times [2023-08-27 03:42:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025128926] [2023-08-27 03:42:55,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:55,867 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-27 03:42:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025128926] [2023-08-27 03:42:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025128926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:42:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424744299] [2023-08-27 03:42:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:55,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:42:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:55,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:42:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:42:55,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2023-08-27 03:42:55,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:55,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:55,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2023-08-27 03:42:55,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:56,053 INFO L124 PetriNetUnfolderBase]: 550/938 cut-off events. [2023-08-27 03:42:56,053 INFO L125 PetriNetUnfolderBase]: For 3101/3101 co-relation queries the response was YES. [2023-08-27 03:42:56,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 938 events. 550/938 cut-off events. For 3101/3101 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4042 event pairs, 80 based on Foata normal form. 1/939 useless extension candidates. Maximal degree in co-relation 4237. Up to 516 conditions per place. [2023-08-27 03:42:56,058 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 63 selfloop transitions, 15 changer transitions 28/106 dead transitions. [2023-08-27 03:42:56,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 934 flow [2023-08-27 03:42:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:42:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:42:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-27 03:42:56,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2023-08-27 03:42:56,060 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-27 03:42:56,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-27 03:42:56,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:56,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-27 03:42:56,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,065 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 317 flow. Second operand 5 states and 600 transitions. [2023-08-27 03:42:56,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 934 flow [2023-08-27 03:42:56,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 765 flow, removed 7 selfloop flow, removed 15 redundant places. [2023-08-27 03:42:56,074 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 350 flow [2023-08-27 03:42:56,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-08-27 03:42:56,076 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-27 03:42:56,076 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 350 flow [2023-08-27 03:42:56,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:56,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:56,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:42:56,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:56,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 374606507, now seen corresponding path program 2 times [2023-08-27 03:42:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812017344] [2023-08-27 03:42:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:56,272 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-27 03:42:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:56,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812017344] [2023-08-27 03:42:56,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812017344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:56,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:56,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:42:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939923738] [2023-08-27 03:42:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:42:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:56,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:42:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:42:56,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2023-08-27 03:42:56,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:56,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2023-08-27 03:42:56,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:56,483 INFO L124 PetriNetUnfolderBase]: 566/996 cut-off events. [2023-08-27 03:42:56,483 INFO L125 PetriNetUnfolderBase]: For 2760/2760 co-relation queries the response was YES. [2023-08-27 03:42:56,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4233 conditions, 996 events. 566/996 cut-off events. For 2760/2760 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4487 event pairs, 91 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 4207. Up to 434 conditions per place. [2023-08-27 03:42:56,488 INFO L140 encePairwiseOnDemand]: 257/265 looper letters, 44 selfloop transitions, 5 changer transitions 52/101 dead transitions. [2023-08-27 03:42:56,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 808 flow [2023-08-27 03:42:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:42:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:42:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-08-27 03:42:56,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44150943396226416 [2023-08-27 03:42:56,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-08-27 03:42:56,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-08-27 03:42:56,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:56,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-08-27 03:42:56,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,494 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,494 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 350 flow. Second operand 6 states and 702 transitions. [2023-08-27 03:42:56,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 808 flow [2023-08-27 03:42:56,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 803 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 03:42:56,505 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 226 flow [2023-08-27 03:42:56,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-08-27 03:42:56,506 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2023-08-27 03:42:56,506 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 226 flow [2023-08-27 03:42:56,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:56,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:56,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:56,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:42:56,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:56,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2088887163, now seen corresponding path program 3 times [2023-08-27 03:42:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:56,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249331042] [2023-08-27 03:42:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:42:57,412 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-27 03:42:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:42:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249331042] [2023-08-27 03:42:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249331042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:42:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:42:57,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:42:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229655737] [2023-08-27 03:42:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:42:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:42:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:42:57,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:42:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:42:57,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 265 [2023-08-27 03:42:57,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:57,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:42:57,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 265 [2023-08-27 03:42:57,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:42:57,627 INFO L124 PetriNetUnfolderBase]: 146/301 cut-off events. [2023-08-27 03:42:57,627 INFO L125 PetriNetUnfolderBase]: For 1191/1191 co-relation queries the response was YES. [2023-08-27 03:42:57,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 301 events. 146/301 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1250 event pairs, 20 based on Foata normal form. 1/299 useless extension candidates. Maximal degree in co-relation 1280. Up to 135 conditions per place. [2023-08-27 03:42:57,629 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 38 selfloop transitions, 5 changer transitions 22/68 dead transitions. [2023-08-27 03:42:57,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 551 flow [2023-08-27 03:42:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:42:57,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:42:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions. [2023-08-27 03:42:57,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4207547169811321 [2023-08-27 03:42:57,632 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions. [2023-08-27 03:42:57,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions. [2023-08-27 03:42:57,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:42:57,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions. [2023-08-27 03:42:57,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:57,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:57,650 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 265.0) internal successors, (2385), 9 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:57,650 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 226 flow. Second operand 8 states and 892 transitions. [2023-08-27 03:42:57,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 551 flow [2023-08-27 03:42:57,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 492 flow, removed 6 selfloop flow, removed 15 redundant places. [2023-08-27 03:42:57,654 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 199 flow [2023-08-27 03:42:57,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=199, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-08-27 03:42:57,654 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2023-08-27 03:42:57,654 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 199 flow [2023-08-27 03:42:57,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:42:57,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:42:57,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:57,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:42:57,655 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:42:57,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:42:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash 924968239, now seen corresponding path program 4 times [2023-08-27 03:42:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:42:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15434405] [2023-08-27 03:42:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:42:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:42:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:42:57,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:42:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:42:57,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:42:57,813 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:42:57,814 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:42:57,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 03:42:57,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:42:57,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:42:57,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:42:57,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:42:57,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-27 03:42:57,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:42:57,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:42:57,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:42:57,819 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:42:57,824 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:42:57,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:42:57,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:42:57 BasicIcfg [2023-08-27 03:42:57,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:42:57,911 INFO L158 Benchmark]: Toolchain (without parser) took 25486.94ms. Allocated memory was 388.0MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 362.9MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 63.4MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,911 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 388.0MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:42:57,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.71ms. Allocated memory is still 388.0MB. Free memory was 362.6MB in the beginning and 338.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.13ms. Allocated memory is still 388.0MB. Free memory was 338.4MB in the beginning and 335.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,912 INFO L158 Benchmark]: Boogie Preprocessor took 32.60ms. Allocated memory is still 388.0MB. Free memory was 335.7MB in the beginning and 333.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,912 INFO L158 Benchmark]: RCFGBuilder took 711.66ms. Allocated memory is still 388.0MB. Free memory was 333.2MB in the beginning and 340.6MB in the end (delta: -7.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,912 INFO L158 Benchmark]: TraceAbstraction took 24121.05ms. Allocated memory was 388.0MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 340.3MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 40.3MB. Max. memory is 16.0GB. [2023-08-27 03:42:57,914 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 388.0MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 561.71ms. Allocated memory is still 388.0MB. Free memory was 362.6MB in the beginning and 338.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.13ms. Allocated memory is still 388.0MB. Free memory was 338.4MB in the beginning and 335.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.60ms. Allocated memory is still 388.0MB. Free memory was 335.7MB in the beginning and 333.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 711.66ms. Allocated memory is still 388.0MB. Free memory was 333.2MB in the beginning and 340.6MB in the end (delta: -7.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 24121.05ms. Allocated memory was 388.0MB in the beginning and 2.5GB in the end (delta: 2.1GB). Free memory was 340.3MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 40.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 146 PlacesBefore, 48 PlacesAfterwards, 136 TransitionsBefore, 36 TransitionsAfterwards, 4034 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 2 ChoiceCompositions, 125 TotalNumberOfCompositions, 14632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5662, independent: 5328, independent conditional: 0, independent unconditional: 5328, dependent: 334, dependent conditional: 0, dependent unconditional: 334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2301, independent: 2236, independent conditional: 0, independent unconditional: 2236, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5662, independent: 3092, independent conditional: 0, independent unconditional: 3092, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 2301, unknown conditional: 0, unknown unconditional: 2301] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t525; [L865] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t525, ((void *)0), P0, ((void *)0))=-2, t525={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t526; [L867] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t526, ((void *)0), P1, ((void *)0))=-1, t525={5:0}, t526={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t527; [L869] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t527, ((void *)0), P2, ((void *)0))=0, t525={5:0}, t526={6:0}, t527={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t528; [L871] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t528, ((void *)0), P3, ((void *)0))=1, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] EXPR 4 __unbuffered_cnt + 1 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L760] EXPR 1 __unbuffered_cnt + 1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] EXPR 2 __unbuffered_cnt + 1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] EXPR 3 __unbuffered_cnt + 1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t525={5:0}, t526={6:0}, t527={7:0}, t528={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L884] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix020.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 23 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: 23.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 704 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1821 IncrementalHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 37 mSDtfsCounter, 1821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=786occurred in iteration=11, InterpolantAutomatonStates: 94, 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, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 1763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:42:57,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...