/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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:46:53,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:46:53,297 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:46:53,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:46:53,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:46:53,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:46:53,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:46:53,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:46:53,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:46:53,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:46:53,341 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:46:53,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:46:53,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:46:53,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:46:53,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:46:53,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:46:53,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:46:53,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:46:53,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:46:53,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:46:53,343 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:46:53,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:46:53,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:46:53,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:46:53,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:46:53,346 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:46:53,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:46:53,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:53,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:46:53,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:46:53,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:46:53,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:46:53,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:46:53,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:46:53,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:46:53,349 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:46:53,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:46:53,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:46:53,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:46:53,691 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:46:53,692 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:46:53,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:46:54,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:46:55,032 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:46:55,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:46:55,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e417cac78/575574c6488649bdba0aeffa409d9947/FLAG0fb148e00 [2023-08-27 03:46:55,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e417cac78/575574c6488649bdba0aeffa409d9947 [2023-08-27 03:46:55,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:46:55,060 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:46:55,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:55,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:46:55,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:46:55,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fea0b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55, skipping insertion in model container [2023-08-27 03:46:55,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,120 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:46:55,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:55,509 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:46:55,537 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:55,538 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:55,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:55,610 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:55,611 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:55,617 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:46:55,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55 WrapperNode [2023-08-27 03:46:55,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:55,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:55,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:46:55,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:46:55,625 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:46:55" (1/1) ... [2023-08-27 03:46:55,652 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:46:55" (1/1) ... [2023-08-27 03:46:55,689 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2023-08-27 03:46:55,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:55,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:46:55,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:46:55,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:46:55,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:46:55,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:46:55,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:46:55,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:46:55,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (1/1) ... [2023-08-27 03:46:55,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:46:55,782 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:46:55,797 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:46:55,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:46:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:46:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:46:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:46:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:46:55,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:46:55,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:46:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:46:55,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:46:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:46:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:46:55,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:46:55,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:46:55,820 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:46:55,978 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:46:55,981 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:46:56,235 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:46:56,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:46:56,463 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:46:56,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:56 BoogieIcfgContainer [2023-08-27 03:46:56,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:46:56,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:46:56,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:46:56,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:46:56,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:46:55" (1/3) ... [2023-08-27 03:46:56,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54086070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:56, skipping insertion in model container [2023-08-27 03:46:56,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:55" (2/3) ... [2023-08-27 03:46:56,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54086070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:56, skipping insertion in model container [2023-08-27 03:46:56,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:56" (3/3) ... [2023-08-27 03:46:56,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:46:56,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:46:56,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:46:56,488 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:46:56,538 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:46:56,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-27 03:46:56,637 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-27 03:46:56,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 03:46:56,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-27 03:46:56,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-27 03:46:56,650 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:46:56,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-27 03:46:56,667 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-27 03:46:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-27 03:46:56,702 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-27 03:46:56,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-27 03:46:56,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 1644 [2023-08-27 03:47:00,092 INFO L134 LiptonReduction]: Checked pairs total: 5730 [2023-08-27 03:47:00,093 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-27 03:47:00,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:47:00,122 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;@4e78ecec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:47:00,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:47:00,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:47:00,125 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:47:00,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:00,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:00,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:47:00,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:00,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 447671020, now seen corresponding path program 1 times [2023-08-27 03:47:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626548837] [2023-08-27 03:47:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:00,549 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:47:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626548837] [2023-08-27 03:47:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626548837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:00,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202234491] [2023-08-27 03:47:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:00,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:00,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189 [2023-08-27 03:47:00,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:00,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189 [2023-08-27 03:47:00,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:00,763 INFO L124 PetriNetUnfolderBase]: 264/559 cut-off events. [2023-08-27 03:47:00,764 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 03:47:00,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 559 events. 264/559 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2917 event pairs, 32 based on Foata normal form. 25/461 useless extension candidates. Maximal degree in co-relation 1015. Up to 373 conditions per place. [2023-08-27 03:47:00,773 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 26 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-27 03:47:00,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 128 flow [2023-08-27 03:47:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-08-27 03:47:00,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48853615520282184 [2023-08-27 03:47:00,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-08-27 03:47:00,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-08-27 03:47:00,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:00,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-08-27 03:47:00,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:47:00,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,806 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 3 states and 277 transitions. [2023-08-27 03:47:00,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 128 flow [2023-08-27 03:47:00,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:00,810 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 54 flow [2023-08-27 03:47:00,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-08-27 03:47:00,815 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-27 03:47:00,815 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2023-08-27 03:47:00,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:00,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:47:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:47:00,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:00,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 991835307, now seen corresponding path program 1 times [2023-08-27 03:47:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818709059] [2023-08-27 03:47:00,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:00,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:00,881 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:47:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818709059] [2023-08-27 03:47:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818709059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116879762] [2023-08-27 03:47:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:00,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:00,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189 [2023-08-27 03:47:00,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:47:00,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:00,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189 [2023-08-27 03:47:00,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:00,992 INFO L124 PetriNetUnfolderBase]: 183/352 cut-off events. [2023-08-27 03:47:00,992 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-27 03:47:00,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 352 events. 183/352 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1503 event pairs, 80 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 716. Up to 183 conditions per place. [2023-08-27 03:47:00,995 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 31 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-08-27 03:47:00,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 154 flow [2023-08-27 03:47:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-27 03:47:00,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48500881834215165 [2023-08-27 03:47:00,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-27 03:47:00,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-27 03:47:00,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:00,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-27 03:47:01,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:01,004 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 3 states and 275 transitions. [2023-08-27 03:47:01,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 154 flow [2023-08-27 03:47:01,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:01,005 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 75 flow [2023-08-27 03:47:01,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-08-27 03:47:01,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-27 03:47:01,007 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 75 flow [2023-08-27 03:47:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:47:01,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:01,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:01,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:47:01,012 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:01,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash 695336851, now seen corresponding path program 1 times [2023-08-27 03:47:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:01,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996905370] [2023-08-27 03:47:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:01,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:01,611 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:47:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:01,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996905370] [2023-08-27 03:47:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996905370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114562069] [2023-08-27 03:47:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:01,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:01,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:01,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:01,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 189 [2023-08-27 03:47:01,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:47:01,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:01,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 189 [2023-08-27 03:47:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:01,822 INFO L124 PetriNetUnfolderBase]: 349/607 cut-off events. [2023-08-27 03:47:01,822 INFO L125 PetriNetUnfolderBase]: For 47/49 co-relation queries the response was YES. [2023-08-27 03:47:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 607 events. 349/607 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2408 event pairs, 85 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1392. Up to 329 conditions per place. [2023-08-27 03:47:01,826 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 43 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2023-08-27 03:47:01,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 52 transitions, 249 flow [2023-08-27 03:47:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2023-08-27 03:47:01,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4158730158730159 [2023-08-27 03:47:01,828 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 393 transitions. [2023-08-27 03:47:01,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 393 transitions. [2023-08-27 03:47:01,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:01,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 393 transitions. [2023-08-27 03:47:01,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.6) internal successors, (393), 5 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:47:01,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:01,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:01,833 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 75 flow. Second operand 5 states and 393 transitions. [2023-08-27 03:47:01,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 52 transitions, 249 flow [2023-08-27 03:47:01,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:01,836 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 106 flow [2023-08-27 03:47:01,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-27 03:47:01,838 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-08-27 03:47:01,838 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 106 flow [2023-08-27 03:47:01,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.6) internal successors, (353), 5 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:47:01,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:01,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:01,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:47:01,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:01,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1825028481, now seen corresponding path program 1 times [2023-08-27 03:47:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:01,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867484696] [2023-08-27 03:47:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:02,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:47:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867484696] [2023-08-27 03:47:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867484696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:02,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877230262] [2023-08-27 03:47:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:02,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:02,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:02,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:02,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 189 [2023-08-27 03:47:02,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:47:02,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:02,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 189 [2023-08-27 03:47:02,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:02,583 INFO L124 PetriNetUnfolderBase]: 320/630 cut-off events. [2023-08-27 03:47:02,584 INFO L125 PetriNetUnfolderBase]: For 297/301 co-relation queries the response was YES. [2023-08-27 03:47:02,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 630 events. 320/630 cut-off events. For 297/301 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3103 event pairs, 45 based on Foata normal form. 19/600 useless extension candidates. Maximal degree in co-relation 1568. Up to 298 conditions per place. [2023-08-27 03:47:02,588 INFO L140 encePairwiseOnDemand]: 180/189 looper letters, 54 selfloop transitions, 20 changer transitions 2/81 dead transitions. [2023-08-27 03:47:02,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 410 flow [2023-08-27 03:47:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:47:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:47:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 660 transitions. [2023-08-27 03:47:02,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2023-08-27 03:47:02,590 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 660 transitions. [2023-08-27 03:47:02,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 660 transitions. [2023-08-27 03:47:02,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:02,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 660 transitions. [2023-08-27 03:47:02,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.5) internal successors, (660), 8 states have internal predecessors, (660), 0 states have call successors, (0), 0 states 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:47:02,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states 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:47:02,595 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states 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:47:02,596 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 106 flow. Second operand 8 states and 660 transitions. [2023-08-27 03:47:02,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 410 flow [2023-08-27 03:47:02,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 81 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:47:02,599 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 280 flow [2023-08-27 03:47:02,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-08-27 03:47:02,600 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-08-27 03:47:02,600 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 280 flow [2023-08-27 03:47:02,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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:47:02,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:02,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:02,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:47:02,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:02,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1796429121, now seen corresponding path program 2 times [2023-08-27 03:47:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103032160] [2023-08-27 03:47:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:02,981 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:47:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:02,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103032160] [2023-08-27 03:47:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103032160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:02,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682760450] [2023-08-27 03:47:02,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:02,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:02,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:02,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 189 [2023-08-27 03:47:02,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 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:47:02,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:02,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 189 [2023-08-27 03:47:02,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:03,312 INFO L124 PetriNetUnfolderBase]: 388/746 cut-off events. [2023-08-27 03:47:03,312 INFO L125 PetriNetUnfolderBase]: For 1690/1710 co-relation queries the response was YES. [2023-08-27 03:47:03,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 746 events. 388/746 cut-off events. For 1690/1710 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3748 event pairs, 38 based on Foata normal form. 28/691 useless extension candidates. Maximal degree in co-relation 2607. Up to 248 conditions per place. [2023-08-27 03:47:03,318 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 68 selfloop transitions, 34 changer transitions 2/107 dead transitions. [2023-08-27 03:47:03,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 107 transitions, 786 flow [2023-08-27 03:47:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:47:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:47:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 711 transitions. [2023-08-27 03:47:03,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2023-08-27 03:47:03,321 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 711 transitions. [2023-08-27 03:47:03,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 711 transitions. [2023-08-27 03:47:03,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:03,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 711 transitions. [2023-08-27 03:47:03,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:47:03,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:47:03,327 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states 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:47:03,327 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 280 flow. Second operand 9 states and 711 transitions. [2023-08-27 03:47:03,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 107 transitions, 786 flow [2023-08-27 03:47:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:47:03,337 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 562 flow [2023-08-27 03:47:03,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=562, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-27 03:47:03,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2023-08-27 03:47:03,339 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 562 flow [2023-08-27 03:47:03,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 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:47:03,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:03,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:47:03,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:03,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 386039138, now seen corresponding path program 1 times [2023-08-27 03:47:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62131586] [2023-08-27 03:47:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:03,843 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:47:03,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62131586] [2023-08-27 03:47:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62131586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:03,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154059004] [2023-08-27 03:47:03,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:03,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:03,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:03,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 189 [2023-08-27 03:47:03,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:47:03,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:03,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 189 [2023-08-27 03:47:03,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:04,019 INFO L124 PetriNetUnfolderBase]: 311/632 cut-off events. [2023-08-27 03:47:04,019 INFO L125 PetriNetUnfolderBase]: For 2615/2659 co-relation queries the response was YES. [2023-08-27 03:47:04,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 632 events. 311/632 cut-off events. For 2615/2659 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3288 event pairs, 61 based on Foata normal form. 40/585 useless extension candidates. Maximal degree in co-relation 2614. Up to 419 conditions per place. [2023-08-27 03:47:04,025 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 67 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2023-08-27 03:47:04,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 771 flow [2023-08-27 03:47:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-08-27 03:47:04,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597883597883597 [2023-08-27 03:47:04,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-08-27 03:47:04,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-08-27 03:47:04,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:04,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-08-27 03:47:04,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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:47:04,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:04,030 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:04,030 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 562 flow. Second operand 5 states and 412 transitions. [2023-08-27 03:47:04,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 771 flow [2023-08-27 03:47:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 755 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:04,044 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 596 flow [2023-08-27 03:47:04,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=596, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2023-08-27 03:47:04,046 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2023-08-27 03:47:04,048 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 596 flow [2023-08-27 03:47:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:47:04,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:04,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:47:04,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:04,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1326938230, now seen corresponding path program 2 times [2023-08-27 03:47:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489453703] [2023-08-27 03:47:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:04,270 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:47:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489453703] [2023-08-27 03:47:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489453703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:04,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638038710] [2023-08-27 03:47:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:04,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 189 [2023-08-27 03:47:04,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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:47:04,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:04,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 189 [2023-08-27 03:47:04,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:04,379 INFO L124 PetriNetUnfolderBase]: 156/383 cut-off events. [2023-08-27 03:47:04,379 INFO L125 PetriNetUnfolderBase]: For 1861/1903 co-relation queries the response was YES. [2023-08-27 03:47:04,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 383 events. 156/383 cut-off events. For 1861/1903 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1946 event pairs, 26 based on Foata normal form. 26/365 useless extension candidates. Maximal degree in co-relation 1650. Up to 146 conditions per place. [2023-08-27 03:47:04,382 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 66 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-08-27 03:47:04,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 78 transitions, 744 flow [2023-08-27 03:47:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 350 transitions. [2023-08-27 03:47:04,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2023-08-27 03:47:04,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 350 transitions. [2023-08-27 03:47:04,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 350 transitions. [2023-08-27 03:47:04,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:04,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 350 transitions. [2023-08-27 03:47:04,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.5) internal successors, (350), 4 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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:47:04,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,387 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 596 flow. Second operand 4 states and 350 transitions. [2023-08-27 03:47:04,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 78 transitions, 744 flow [2023-08-27 03:47:04,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 717 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:04,395 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 502 flow [2023-08-27 03:47:04,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-08-27 03:47:04,396 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2023-08-27 03:47:04,396 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 502 flow [2023-08-27 03:47:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 0 states have call successors, (0), 0 states 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:47:04,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:04,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:47:04,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:04,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 64991886, now seen corresponding path program 1 times [2023-08-27 03:47:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347746722] [2023-08-27 03:47:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:04,442 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:47:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347746722] [2023-08-27 03:47:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347746722] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270275450] [2023-08-27 03:47:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:04,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:04,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:04,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189 [2023-08-27 03:47:04,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:47:04,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:04,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189 [2023-08-27 03:47:04,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:04,537 INFO L124 PetriNetUnfolderBase]: 141/343 cut-off events. [2023-08-27 03:47:04,537 INFO L125 PetriNetUnfolderBase]: For 1532/1567 co-relation queries the response was YES. [2023-08-27 03:47:04,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 343 events. 141/343 cut-off events. For 1532/1567 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1692 event pairs, 35 based on Foata normal form. 4/325 useless extension candidates. Maximal degree in co-relation 1557. Up to 170 conditions per place. [2023-08-27 03:47:04,540 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 58 selfloop transitions, 6 changer transitions 5/75 dead transitions. [2023-08-27 03:47:04,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 75 transitions, 764 flow [2023-08-27 03:47:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 352 transitions. [2023-08-27 03:47:04,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656084656084656 [2023-08-27 03:47:04,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 352 transitions. [2023-08-27 03:47:04,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 352 transitions. [2023-08-27 03:47:04,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:04,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 352 transitions. [2023-08-27 03:47:04,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:47:04,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,545 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,545 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 502 flow. Second operand 4 states and 352 transitions. [2023-08-27 03:47:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 75 transitions, 764 flow [2023-08-27 03:47:04,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 752 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:04,555 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 497 flow [2023-08-27 03:47:04,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=497, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-08-27 03:47:04,556 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 37 predicate places. [2023-08-27 03:47:04,556 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 497 flow [2023-08-27 03:47:04,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:47:04,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:04,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:04,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:47:04,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:04,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 64991885, now seen corresponding path program 1 times [2023-08-27 03:47:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780869796] [2023-08-27 03:47:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:04,600 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:47:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780869796] [2023-08-27 03:47:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780869796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:04,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926387445] [2023-08-27 03:47:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:04,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:04,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 189 [2023-08-27 03:47:04,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 497 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:47:04,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:04,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 189 [2023-08-27 03:47:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:04,689 INFO L124 PetriNetUnfolderBase]: 126/307 cut-off events. [2023-08-27 03:47:04,689 INFO L125 PetriNetUnfolderBase]: For 1392/1427 co-relation queries the response was YES. [2023-08-27 03:47:04,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 307 events. 126/307 cut-off events. For 1392/1427 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1479 event pairs, 30 based on Foata normal form. 25/331 useless extension candidates. Maximal degree in co-relation 1443. Up to 164 conditions per place. [2023-08-27 03:47:04,691 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 35 selfloop transitions, 4 changer transitions 20/64 dead transitions. [2023-08-27 03:47:04,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 653 flow [2023-08-27 03:47:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2023-08-27 03:47:04,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2023-08-27 03:47:04,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 344 transitions. [2023-08-27 03:47:04,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 344 transitions. [2023-08-27 03:47:04,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:04,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 344 transitions. [2023-08-27 03:47:04,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:47:04,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,695 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 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:47:04,695 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 497 flow. Second operand 4 states and 344 transitions. [2023-08-27 03:47:04,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 653 flow [2023-08-27 03:47:04,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 638 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:04,702 INFO L231 Difference]: Finished difference. Result has 66 places, 37 transitions, 316 flow [2023-08-27 03:47:04,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=66, PETRI_TRANSITIONS=37} [2023-08-27 03:47:04,703 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2023-08-27 03:47:04,703 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 37 transitions, 316 flow [2023-08-27 03:47:04,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states 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:47:04,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:04,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:04,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:47:04,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:04,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1131258496, now seen corresponding path program 1 times [2023-08-27 03:47:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342443569] [2023-08-27 03:47:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:04,841 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:47:04,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:04,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342443569] [2023-08-27 03:47:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342443569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:04,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288376773] [2023-08-27 03:47:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:04,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:04,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 189 [2023-08-27 03:47:04,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 37 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:47:04,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:04,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 189 [2023-08-27 03:47:04,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:04,922 INFO L124 PetriNetUnfolderBase]: 65/166 cut-off events. [2023-08-27 03:47:04,922 INFO L125 PetriNetUnfolderBase]: For 698/710 co-relation queries the response was YES. [2023-08-27 03:47:04,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 166 events. 65/166 cut-off events. For 698/710 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 665 event pairs, 20 based on Foata normal form. 12/177 useless extension candidates. Maximal degree in co-relation 719. Up to 66 conditions per place. [2023-08-27 03:47:04,924 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 29 selfloop transitions, 7 changer transitions 5/46 dead transitions. [2023-08-27 03:47:04,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 46 transitions, 445 flow [2023-08-27 03:47:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-27 03:47:04,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2023-08-27 03:47:04,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-27 03:47:04,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-27 03:47:04,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:04,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-27 03:47:04,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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:47:04,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:04,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:04,929 INFO L175 Difference]: Start difference. First operand has 66 places, 37 transitions, 316 flow. Second operand 5 states and 415 transitions. [2023-08-27 03:47:04,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 46 transitions, 445 flow [2023-08-27 03:47:04,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 371 flow, removed 14 selfloop flow, removed 14 redundant places. [2023-08-27 03:47:04,932 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 254 flow [2023-08-27 03:47:04,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-08-27 03:47:04,933 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-08-27 03:47:04,933 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 254 flow [2023-08-27 03:47:04,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.2) internal successors, (396), 5 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:47:04,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:04,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:04,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:47:04,934 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:04,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash -729734593, now seen corresponding path program 1 times [2023-08-27 03:47:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244707047] [2023-08-27 03:47:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244707047] [2023-08-27 03:47:05,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244707047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:05,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594150361] [2023-08-27 03:47:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:05,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:05,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 189 [2023-08-27 03:47:05,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 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:47:05,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:05,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 189 [2023-08-27 03:47:05,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:05,204 INFO L124 PetriNetUnfolderBase]: 112/261 cut-off events. [2023-08-27 03:47:05,204 INFO L125 PetriNetUnfolderBase]: For 813/815 co-relation queries the response was YES. [2023-08-27 03:47:05,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 261 events. 112/261 cut-off events. For 813/815 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 9 based on Foata normal form. 3/264 useless extension candidates. Maximal degree in co-relation 1126. Up to 125 conditions per place. [2023-08-27 03:47:05,206 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 26 selfloop transitions, 1 changer transitions 29/59 dead transitions. [2023-08-27 03:47:05,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 551 flow [2023-08-27 03:47:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2023-08-27 03:47:05,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44232804232804235 [2023-08-27 03:47:05,208 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 418 transitions. [2023-08-27 03:47:05,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 418 transitions. [2023-08-27 03:47:05,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:05,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 418 transitions. [2023-08-27 03:47:05,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:47:05,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:05,211 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states 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:47:05,211 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 254 flow. Second operand 5 states and 418 transitions. [2023-08-27 03:47:05,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 551 flow [2023-08-27 03:47:05,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 488 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:47:05,214 INFO L231 Difference]: Finished difference. Result has 52 places, 26 transitions, 161 flow [2023-08-27 03:47:05,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=52, PETRI_TRANSITIONS=26} [2023-08-27 03:47:05,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-08-27 03:47:05,215 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 26 transitions, 161 flow [2023-08-27 03:47:05,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 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:47:05,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:05,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:05,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:47:05,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:47:05,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash 365838357, now seen corresponding path program 2 times [2023-08-27 03:47:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171024079] [2023-08-27 03:47:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:05,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:47:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:05,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:47:05,296 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:47:05,297 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:47:05,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-27 03:47:05,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:47:05,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:47:05,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:47:05,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:47:05,300 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:05,305 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:47:05,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:47:05,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:47:05 BasicIcfg [2023-08-27 03:47:05,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:47:05,374 INFO L158 Benchmark]: Toolchain (without parser) took 10314.69ms. Allocated memory was 379.6MB in the beginning and 553.6MB in the end (delta: 174.1MB). Free memory was 354.5MB in the beginning and 487.4MB in the end (delta: -133.0MB). Peak memory consumption was 42.6MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,374 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 379.6MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:47:05,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.21ms. Allocated memory is still 379.6MB. Free memory was 354.0MB in the beginning and 331.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.65ms. Allocated memory is still 379.6MB. Free memory was 331.4MB in the beginning and 328.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,375 INFO L158 Benchmark]: Boogie Preprocessor took 51.50ms. Allocated memory is still 379.6MB. Free memory was 328.8MB in the beginning and 327.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,375 INFO L158 Benchmark]: RCFGBuilder took 715.38ms. Allocated memory is still 379.6MB. Free memory was 327.2MB in the beginning and 344.7MB in the end (delta: -17.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,376 INFO L158 Benchmark]: TraceAbstraction took 8906.96ms. Allocated memory was 379.6MB in the beginning and 553.6MB in the end (delta: 174.1MB). Free memory was 344.7MB in the beginning and 487.4MB in the end (delta: -142.7MB). Peak memory consumption was 34.2MB. Max. memory is 16.0GB. [2023-08-27 03:47:05,380 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 379.6MB. Free memory is still 355.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 557.21ms. Allocated memory is still 379.6MB. Free memory was 354.0MB in the beginning and 331.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.65ms. Allocated memory is still 379.6MB. Free memory was 331.4MB in the beginning and 328.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.50ms. Allocated memory is still 379.6MB. Free memory was 328.8MB in the beginning and 327.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 715.38ms. Allocated memory is still 379.6MB. Free memory was 327.2MB in the beginning and 344.7MB in the end (delta: -17.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * TraceAbstraction took 8906.96ms. Allocated memory was 379.6MB in the beginning and 553.6MB in the end (delta: 174.1MB). Free memory was 344.7MB in the beginning and 487.4MB in the end (delta: -142.7MB). Peak memory consumption was 34.2MB. 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: 3.4s, 101 PlacesBefore, 31 PlacesAfterwards, 97 TransitionsBefore, 25 TransitionsAfterwards, 1644 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 5730 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2359, independent: 2139, independent conditional: 0, independent unconditional: 2139, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 922, independent: 891, independent conditional: 0, independent unconditional: 891, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2359, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 922, unknown conditional: 0, unknown unconditional: 922] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=0, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=1, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] EXPR 1 __unbuffered_cnt + 1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] EXPR 2 __unbuffered_cnt + 1 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 753]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 753]: 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: 787]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 787]: 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 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: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 122 locations, 13 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: 8.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 23 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:47:05,412 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...