/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/mix001.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:35:25,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:35:26,064 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:35:26,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:35:26,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:35:26,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:35:26,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:35:26,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:35:26,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:35:26,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:35:26,105 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:35:26,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:35:26,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:35:26,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:35:26,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:35:26,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:35:26,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:35:26,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:35:26,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:35:26,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:35:26,108 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:35:26,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:35:26,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:35:26,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:35:26,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:35:26,110 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:35:26,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:35:26,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:35:26,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:35:26,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:35:26,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:35:26,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:35:26,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:35:26,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:35:26,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:35:26,113 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:35:26,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:35:26,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:35:26,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:35:26,448 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:35:26,452 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:35:26,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2023-08-27 03:35:27,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:35:27,943 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:35:27,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2023-08-27 03:35:27,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4850a0799/bf71be52a1c2486ab6d51ff96c660caf/FLAG0f35ccee5 [2023-08-27 03:35:27,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4850a0799/bf71be52a1c2486ab6d51ff96c660caf [2023-08-27 03:35:27,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:35:27,994 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:35:27,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:35:27,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:35:27,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:35:28,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:35:27" (1/1) ... [2023-08-27 03:35:28,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75786950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28, skipping insertion in model container [2023-08-27 03:35:28,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:35:27" (1/1) ... [2023-08-27 03:35:28,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:35:28,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:35:28,428 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:35:28,446 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:35:28,448 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:35:28,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:35:28,508 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:35:28,509 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:35:28,515 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:35:28,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28 WrapperNode [2023-08-27 03:35:28,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:35:28,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:35:28,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:35:28,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:35:28,522 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:35:28" (1/1) ... [2023-08-27 03:35:28,543 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:35:28" (1/1) ... [2023-08-27 03:35:28,568 INFO L138 Inliner]: procedures = 176, calls = 61, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-08-27 03:35:28,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:35:28,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:35:28,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:35:28,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:35:28,577 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:35:28,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:35:28,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:35:28,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:35:28,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (1/1) ... [2023-08-27 03:35:28,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:35:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:35:28,635 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:35:28,652 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:35:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:35:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:35:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:35:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:35:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:35:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:35:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:35:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:35:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:35:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:35:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:35:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:35:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:35:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:35:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:35:28,683 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:35:28,830 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:35:28,832 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:35:29,274 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:35:29,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:35:29,396 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:35:29,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:35:29 BoogieIcfgContainer [2023-08-27 03:35:29,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:35:29,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:35:29,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:35:29,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:35:29,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:35:27" (1/3) ... [2023-08-27 03:35:29,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee66a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:35:29, skipping insertion in model container [2023-08-27 03:35:29,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:35:28" (2/3) ... [2023-08-27 03:35:29,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee66a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:35:29, skipping insertion in model container [2023-08-27 03:35:29,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:35:29" (3/3) ... [2023-08-27 03:35:29,405 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2023-08-27 03:35:29,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:35:29,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:35:29,421 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:35:29,483 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:35:29,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 265 flow [2023-08-27 03:35:29,592 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-08-27 03:35:29,592 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:35:29,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-08-27 03:35:29,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 125 transitions, 265 flow [2023-08-27 03:35:29,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 122 transitions, 253 flow [2023-08-27 03:35:29,607 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:35:29,618 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 122 transitions, 253 flow [2023-08-27 03:35:29,621 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 122 transitions, 253 flow [2023-08-27 03:35:29,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 253 flow [2023-08-27 03:35:29,660 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-08-27 03:35:29,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:35:29,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-08-27 03:35:29,665 INFO L119 LiptonReduction]: Number of co-enabled transitions 3134 [2023-08-27 03:35:33,459 INFO L134 LiptonReduction]: Checked pairs total: 11736 [2023-08-27 03:35:33,459 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-08-27 03:35:33,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:35:33,476 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;@5565733c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:35:33,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:35:33,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:35:33,479 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 03:35:33,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:35:33,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:33,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:35:33,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:33,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 586610, now seen corresponding path program 1 times [2023-08-27 03:35:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:33,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929572457] [2023-08-27 03:35:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:33,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:33,859 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:35:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929572457] [2023-08-27 03:35:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929572457] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:35:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346989690] [2023-08-27 03:35:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:33,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:35:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:35:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:35:33,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2023-08-27 03:35:33,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:35:33,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:33,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2023-08-27 03:35:33,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:34,387 INFO L124 PetriNetUnfolderBase]: 2149/3480 cut-off events. [2023-08-27 03:35:34,387 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-27 03:35:34,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 3480 events. 2149/3480 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21646 event pairs, 224 based on Foata normal form. 0/2787 useless extension candidates. Maximal degree in co-relation 6670. Up to 2736 conditions per place. [2023-08-27 03:35:34,415 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-27 03:35:34,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 193 flow [2023-08-27 03:35:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:35:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:35:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-27 03:35:34,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183553597650514 [2023-08-27 03:35:34,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-27 03:35:34,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-27 03:35:34,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:34,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-27 03:35:34,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 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:35:34,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:34,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:34,440 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 3 states and 353 transitions. [2023-08-27 03:35:34,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 193 flow [2023-08-27 03:35:34,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:35:34,444 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 72 flow [2023-08-27 03:35:34,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2023-08-27 03:35:34,448 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-27 03:35:34,449 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 72 flow [2023-08-27 03:35:34,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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:35:34,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:34,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:34,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:35:34,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:34,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash 594905397, now seen corresponding path program 1 times [2023-08-27 03:35:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:34,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225692895] [2023-08-27 03:35:34,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:34,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:34,531 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:35:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225692895] [2023-08-27 03:35:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225692895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:35:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208614498] [2023-08-27 03:35:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:35:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:35:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:35:34,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-27 03:35:34,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:35:34,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:34,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-27 03:35:34,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:34,939 INFO L124 PetriNetUnfolderBase]: 1682/2581 cut-off events. [2023-08-27 03:35:34,939 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-27 03:35:34,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 2581 events. 1682/2581 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13110 event pairs, 608 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 5316. Up to 1766 conditions per place. [2023-08-27 03:35:34,953 INFO L140 encePairwiseOnDemand]: 217/227 looper letters, 42 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-08-27 03:35:34,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 208 flow [2023-08-27 03:35:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:35:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:35:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-27 03:35:34,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124816446402349 [2023-08-27 03:35:34,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-27 03:35:34,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-27 03:35:34,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:34,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-27 03:35:34,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states 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:35:34,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:34,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:34,961 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 72 flow. Second operand 3 states and 349 transitions. [2023-08-27 03:35:34,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 208 flow [2023-08-27 03:35:34,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:34,963 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 104 flow [2023-08-27 03:35:34,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-27 03:35:34,964 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2023-08-27 03:35:34,964 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 104 flow [2023-08-27 03:35:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:35:34,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:34,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:34,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:35:34,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:34,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 919748810, now seen corresponding path program 1 times [2023-08-27 03:35:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:34,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524214644] [2023-08-27 03:35:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:35,193 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:35:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524214644] [2023-08-27 03:35:35,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524214644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:35,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:35:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131343598] [2023-08-27 03:35:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:35,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:35:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:35:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:35:35,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-27 03:35:35,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:35:35,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:35,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-27 03:35:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:35,774 INFO L124 PetriNetUnfolderBase]: 3325/5090 cut-off events. [2023-08-27 03:35:35,774 INFO L125 PetriNetUnfolderBase]: For 409/436 co-relation queries the response was YES. [2023-08-27 03:35:35,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11767 conditions, 5090 events. 3325/5090 cut-off events. For 409/436 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26571 event pairs, 1458 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 11756. Up to 4185 conditions per place. [2023-08-27 03:35:35,801 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 51 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2023-08-27 03:35:35,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 303 flow [2023-08-27 03:35:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:35:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:35:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-27 03:35:35,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889867841409692 [2023-08-27 03:35:35,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-27 03:35:35,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-27 03:35:35,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:35,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-27 03:35:35,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:35:35,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:35,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:35:35,808 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 104 flow. Second operand 3 states and 333 transitions. [2023-08-27 03:35:35,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 303 flow [2023-08-27 03:35:35,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:35:35,811 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 162 flow [2023-08-27 03:35:35,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-27 03:35:35,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-27 03:35:35,812 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 162 flow [2023-08-27 03:35:35,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:35:35,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:35,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:35,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:35:35,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:35,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1365728623, now seen corresponding path program 1 times [2023-08-27 03:35:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423094973] [2023-08-27 03:35:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:36,000 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:35:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423094973] [2023-08-27 03:35:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423094973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:35:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110612429] [2023-08-27 03:35:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:36,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-27 03:35:36,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:35:36,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:36,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-27 03:35:36,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:36,569 INFO L124 PetriNetUnfolderBase]: 3150/4844 cut-off events. [2023-08-27 03:35:36,569 INFO L125 PetriNetUnfolderBase]: For 1638/1666 co-relation queries the response was YES. [2023-08-27 03:35:36,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13052 conditions, 4844 events. 3150/4844 cut-off events. For 1638/1666 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 25056 event pairs, 885 based on Foata normal form. 68/4620 useless extension candidates. Maximal degree in co-relation 13038. Up to 2968 conditions per place. [2023-08-27 03:35:36,597 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 64 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2023-08-27 03:35:36,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 436 flow [2023-08-27 03:35:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-27 03:35:36,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47577092511013214 [2023-08-27 03:35:36,599 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-27 03:35:36,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-27 03:35:36,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:36,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-27 03:35:36,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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:35:36,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:36,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:36,603 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 162 flow. Second operand 4 states and 432 transitions. [2023-08-27 03:35:36,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 436 flow [2023-08-27 03:35:36,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:36,622 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 214 flow [2023-08-27 03:35:36,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-27 03:35:36,623 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-27 03:35:36,623 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 214 flow [2023-08-27 03:35:36,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:35:36,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:36,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:36,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:35:36,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:36,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -927335482, now seen corresponding path program 1 times [2023-08-27 03:35:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664680293] [2023-08-27 03:35:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:36,748 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:35:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664680293] [2023-08-27 03:35:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664680293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:35:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340186025] [2023-08-27 03:35:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:36,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:36,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:36,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:36,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-27 03:35:36,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:35:36,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:36,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-27 03:35:36,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:37,310 INFO L124 PetriNetUnfolderBase]: 3017/4668 cut-off events. [2023-08-27 03:35:37,310 INFO L125 PetriNetUnfolderBase]: For 3047/3065 co-relation queries the response was YES. [2023-08-27 03:35:37,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13336 conditions, 4668 events. 3017/4668 cut-off events. For 3047/3065 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 24240 event pairs, 1511 based on Foata normal form. 53/4439 useless extension candidates. Maximal degree in co-relation 13319. Up to 2941 conditions per place. [2023-08-27 03:35:37,334 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 71 selfloop transitions, 14 changer transitions 0/88 dead transitions. [2023-08-27 03:35:37,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 556 flow [2023-08-27 03:35:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-27 03:35:37,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801762114537445 [2023-08-27 03:35:37,336 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-27 03:35:37,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-27 03:35:37,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:37,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-27 03:35:37,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:35:37,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:37,340 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:37,340 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 214 flow. Second operand 4 states and 436 transitions. [2023-08-27 03:35:37,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 556 flow [2023-08-27 03:35:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:35:37,350 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 342 flow [2023-08-27 03:35:37,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2023-08-27 03:35:37,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-27 03:35:37,351 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 342 flow [2023-08-27 03:35:37,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:35:37,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:37,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:37,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:35:37,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:37,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1180218187, now seen corresponding path program 1 times [2023-08-27 03:35:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130861841] [2023-08-27 03:35:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:37,711 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:35:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:37,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130861841] [2023-08-27 03:35:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130861841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:37,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:35:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28511807] [2023-08-27 03:35:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:37,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:35:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:35:37,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:35:37,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 227 [2023-08-27 03:35:37,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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:35:37,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:37,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 227 [2023-08-27 03:35:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:38,360 INFO L124 PetriNetUnfolderBase]: 2985/4602 cut-off events. [2023-08-27 03:35:38,360 INFO L125 PetriNetUnfolderBase]: For 5384/5436 co-relation queries the response was YES. [2023-08-27 03:35:38,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14524 conditions, 4602 events. 2985/4602 cut-off events. For 5384/5436 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 24110 event pairs, 412 based on Foata normal form. 36/4349 useless extension candidates. Maximal degree in co-relation 14503. Up to 2818 conditions per place. [2023-08-27 03:35:38,389 INFO L140 encePairwiseOnDemand]: 215/227 looper letters, 92 selfloop transitions, 36 changer transitions 0/131 dead transitions. [2023-08-27 03:35:38,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 131 transitions, 987 flow [2023-08-27 03:35:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:35:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:35:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2023-08-27 03:35:38,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45301027900146845 [2023-08-27 03:35:38,392 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2023-08-27 03:35:38,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2023-08-27 03:35:38,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:38,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2023-08-27 03:35:38,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:35:38,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states 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:35:38,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states 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:35:38,397 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 342 flow. Second operand 6 states and 617 transitions. [2023-08-27 03:35:38,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 131 transitions, 987 flow [2023-08-27 03:35:38,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 131 transitions, 977 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:35:38,436 INFO L231 Difference]: Finished difference. Result has 62 places, 79 transitions, 717 flow [2023-08-27 03:35:38,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2023-08-27 03:35:38,437 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-08-27 03:35:38,437 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 717 flow [2023-08-27 03:35:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states 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:35:38,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:38,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:38,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:35:38,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:38,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 132956393, now seen corresponding path program 1 times [2023-08-27 03:35:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613990362] [2023-08-27 03:35:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:38,500 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:35:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613990362] [2023-08-27 03:35:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613990362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:38,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:38,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:35:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120030712] [2023-08-27 03:35:38,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:38,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:38,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:38,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:38,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:38,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-27 03:35:38,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:35:38,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:38,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-27 03:35:38,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:39,021 INFO L124 PetriNetUnfolderBase]: 2486/3862 cut-off events. [2023-08-27 03:35:39,021 INFO L125 PetriNetUnfolderBase]: For 11872/12102 co-relation queries the response was YES. [2023-08-27 03:35:39,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14567 conditions, 3862 events. 2486/3862 cut-off events. For 11872/12102 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 21143 event pairs, 800 based on Foata normal form. 10/3439 useless extension candidates. Maximal degree in co-relation 14540. Up to 1962 conditions per place. [2023-08-27 03:35:39,047 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 75 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2023-08-27 03:35:39,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 104 transitions, 1103 flow [2023-08-27 03:35:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 442 transitions. [2023-08-27 03:35:39,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486784140969163 [2023-08-27 03:35:39,049 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 442 transitions. [2023-08-27 03:35:39,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 442 transitions. [2023-08-27 03:35:39,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:39,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 442 transitions. [2023-08-27 03:35:39,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:35:39,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:39,056 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:39,056 INFO L175 Difference]: Start difference. First operand has 62 places, 79 transitions, 717 flow. Second operand 4 states and 442 transitions. [2023-08-27 03:35:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 104 transitions, 1103 flow [2023-08-27 03:35:39,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 1101 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 03:35:39,084 INFO L231 Difference]: Finished difference. Result has 62 places, 76 transitions, 711 flow [2023-08-27 03:35:39,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=711, PETRI_PLACES=62, PETRI_TRANSITIONS=76} [2023-08-27 03:35:39,085 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-08-27 03:35:39,085 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 76 transitions, 711 flow [2023-08-27 03:35:39,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:35:39,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:39,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:35:39,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:39,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1759954551, now seen corresponding path program 1 times [2023-08-27 03:35:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911008122] [2023-08-27 03:35:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:39,258 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:35:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911008122] [2023-08-27 03:35:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911008122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:39,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:35:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598397297] [2023-08-27 03:35:39,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:39,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-27 03:35:39,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 76 transitions, 711 flow. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 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:35:39,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:39,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-27 03:35:39,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:39,618 INFO L124 PetriNetUnfolderBase]: 1564/2667 cut-off events. [2023-08-27 03:35:39,618 INFO L125 PetriNetUnfolderBase]: For 6283/6350 co-relation queries the response was YES. [2023-08-27 03:35:39,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9539 conditions, 2667 events. 1564/2667 cut-off events. For 6283/6350 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15204 event pairs, 454 based on Foata normal form. 233/2561 useless extension candidates. Maximal degree in co-relation 9510. Up to 1580 conditions per place. [2023-08-27 03:35:39,637 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 81 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-08-27 03:35:39,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 982 flow [2023-08-27 03:35:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:35:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:35:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-27 03:35:39,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775330396475771 [2023-08-27 03:35:39,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-27 03:35:39,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-27 03:35:39,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:39,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-27 03:35:39,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states 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:35:39,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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:35:39,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states 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:35:39,643 INFO L175 Difference]: Start difference. First operand has 62 places, 76 transitions, 711 flow. Second operand 5 states and 542 transitions. [2023-08-27 03:35:39,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 982 flow [2023-08-27 03:35:39,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 968 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:39,664 INFO L231 Difference]: Finished difference. Result has 67 places, 70 transitions, 641 flow [2023-08-27 03:35:39,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=67, PETRI_TRANSITIONS=70} [2023-08-27 03:35:39,665 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2023-08-27 03:35:39,665 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 641 flow [2023-08-27 03:35:39,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 4 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:35:39,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:39,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:39,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:35:39,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:39,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 776097584, now seen corresponding path program 1 times [2023-08-27 03:35:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:39,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545664291] [2023-08-27 03:35:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:39,714 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:35:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:39,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545664291] [2023-08-27 03:35:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545664291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:35:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34711101] [2023-08-27 03:35:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:39,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:39,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-27 03:35:39,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 641 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:35:39,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:39,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-27 03:35:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:40,094 INFO L124 PetriNetUnfolderBase]: 1243/2119 cut-off events. [2023-08-27 03:35:40,095 INFO L125 PetriNetUnfolderBase]: For 5217/5277 co-relation queries the response was YES. [2023-08-27 03:35:40,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8323 conditions, 2119 events. 1243/2119 cut-off events. For 5217/5277 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11643 event pairs, 352 based on Foata normal form. 3/1983 useless extension candidates. Maximal degree in co-relation 8291. Up to 953 conditions per place. [2023-08-27 03:35:40,109 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 73 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2023-08-27 03:35:40,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 1014 flow [2023-08-27 03:35:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-27 03:35:40,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022026431718062 [2023-08-27 03:35:40,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-27 03:35:40,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-27 03:35:40,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:40,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-27 03:35:40,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:35:40,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:40,114 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:40,115 INFO L175 Difference]: Start difference. First operand has 67 places, 70 transitions, 641 flow. Second operand 4 states and 456 transitions. [2023-08-27 03:35:40,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 1014 flow [2023-08-27 03:35:40,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 1003 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:40,133 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 683 flow [2023-08-27 03:35:40,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=683, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2023-08-27 03:35:40,134 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-27 03:35:40,134 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 683 flow [2023-08-27 03:35:40,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states 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:35:40,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:40,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:40,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:35:40,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:40,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1957544680, now seen corresponding path program 1 times [2023-08-27 03:35:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:40,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402391307] [2023-08-27 03:35:40,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:40,283 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:35:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402391307] [2023-08-27 03:35:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402391307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:35:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142744677] [2023-08-27 03:35:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:40,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-27 03:35:40,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 683 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:35:40,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:40,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-27 03:35:40,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:40,656 INFO L124 PetriNetUnfolderBase]: 1892/3213 cut-off events. [2023-08-27 03:35:40,656 INFO L125 PetriNetUnfolderBase]: For 9586/9687 co-relation queries the response was YES. [2023-08-27 03:35:40,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13505 conditions, 3213 events. 1892/3213 cut-off events. For 9586/9687 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 18667 event pairs, 446 based on Foata normal form. 43/3148 useless extension candidates. Maximal degree in co-relation 13472. Up to 1703 conditions per place. [2023-08-27 03:35:40,682 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 123 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2023-08-27 03:35:40,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 1460 flow [2023-08-27 03:35:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-27 03:35:40,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955947136563877 [2023-08-27 03:35:40,684 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-27 03:35:40,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-27 03:35:40,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:40,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-27 03:35:40,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states 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:35:40,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:40,687 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:40,687 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 683 flow. Second operand 4 states and 450 transitions. [2023-08-27 03:35:40,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 1460 flow [2023-08-27 03:35:40,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 1418 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:40,735 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 709 flow [2023-08-27 03:35:40,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-08-27 03:35:40,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-27 03:35:40,736 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 709 flow [2023-08-27 03:35:40,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:35:40,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:40,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:40,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:35:40,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:40,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1795922799, now seen corresponding path program 1 times [2023-08-27 03:35:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340638050] [2023-08-27 03:35:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:40,921 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:35:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:40,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340638050] [2023-08-27 03:35:40,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340638050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:40,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:40,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:35:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544185805] [2023-08-27 03:35:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:40,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:35:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:35:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:35:40,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-27 03:35:40,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 709 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:35:40,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:40,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-27 03:35:40,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:41,511 INFO L124 PetriNetUnfolderBase]: 2817/4790 cut-off events. [2023-08-27 03:35:41,511 INFO L125 PetriNetUnfolderBase]: For 12607/12655 co-relation queries the response was YES. [2023-08-27 03:35:41,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19552 conditions, 4790 events. 2817/4790 cut-off events. For 12607/12655 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30432 event pairs, 414 based on Foata normal form. 42/4690 useless extension candidates. Maximal degree in co-relation 19518. Up to 2469 conditions per place. [2023-08-27 03:35:41,549 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 113 selfloop transitions, 5 changer transitions 0/132 dead transitions. [2023-08-27 03:35:41,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 132 transitions, 1413 flow [2023-08-27 03:35:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:35:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:35:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-27 03:35:41,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911894273127753 [2023-08-27 03:35:41,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-27 03:35:41,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-27 03:35:41,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:41,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-27 03:35:41,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:35:41,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:41,554 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states 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:35:41,554 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 709 flow. Second operand 4 states and 446 transitions. [2023-08-27 03:35:41,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 132 transitions, 1413 flow [2023-08-27 03:35:41,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 132 transitions, 1411 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:35:41,641 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 751 flow [2023-08-27 03:35:41,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=751, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-08-27 03:35:41,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2023-08-27 03:35:41,642 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 751 flow [2023-08-27 03:35:41,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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:35:41,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:41,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:41,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:35:41,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:41,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2008948764, now seen corresponding path program 2 times [2023-08-27 03:35:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:41,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081551199] [2023-08-27 03:35:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:41,845 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:35:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081551199] [2023-08-27 03:35:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081551199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:41,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:35:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786677468] [2023-08-27 03:35:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:35:41,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:35:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:35:41,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-27 03:35:41,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 751 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:35:41,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:41,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-27 03:35:41,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:42,417 INFO L124 PetriNetUnfolderBase]: 1675/3041 cut-off events. [2023-08-27 03:35:42,418 INFO L125 PetriNetUnfolderBase]: For 7223/7312 co-relation queries the response was YES. [2023-08-27 03:35:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11867 conditions, 3041 events. 1675/3041 cut-off events. For 7223/7312 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19420 event pairs, 306 based on Foata normal form. 217/3095 useless extension candidates. Maximal degree in co-relation 11831. Up to 681 conditions per place. [2023-08-27 03:35:42,437 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 89 selfloop transitions, 15 changer transitions 3/122 dead transitions. [2023-08-27 03:35:42,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 122 transitions, 1025 flow [2023-08-27 03:35:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:35:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:35:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions. [2023-08-27 03:35:42,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4764002517306482 [2023-08-27 03:35:42,440 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 757 transitions. [2023-08-27 03:35:42,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions. [2023-08-27 03:35:42,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:42,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions. [2023-08-27 03:35:42,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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:35:42,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states 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:35:42,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states 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:35:42,446 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 751 flow. Second operand 7 states and 757 transitions. [2023-08-27 03:35:42,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 122 transitions, 1025 flow [2023-08-27 03:35:42,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 122 transitions, 1011 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:35:42,477 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 563 flow [2023-08-27 03:35:42,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=563, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-08-27 03:35:42,478 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2023-08-27 03:35:42,478 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 563 flow [2023-08-27 03:35:42,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:35:42,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:42,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:42,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:35:42,479 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:42,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1567910706, now seen corresponding path program 1 times [2023-08-27 03:35:42,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484197373] [2023-08-27 03:35:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:42,748 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:35:42,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:42,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484197373] [2023-08-27 03:35:42,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484197373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:42,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:42,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:35:42,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861712544] [2023-08-27 03:35:42,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:42,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:35:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:35:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:35:42,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-27 03:35:42,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:35:42,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:42,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-27 03:35:42,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:43,174 INFO L124 PetriNetUnfolderBase]: 1527/2680 cut-off events. [2023-08-27 03:35:43,174 INFO L125 PetriNetUnfolderBase]: For 7173/7247 co-relation queries the response was YES. [2023-08-27 03:35:43,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11404 conditions, 2680 events. 1527/2680 cut-off events. For 7173/7247 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16772 event pairs, 229 based on Foata normal form. 53/2657 useless extension candidates. Maximal degree in co-relation 11365. Up to 684 conditions per place. [2023-08-27 03:35:43,185 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 33 selfloop transitions, 10 changer transitions 61/108 dead transitions. [2023-08-27 03:35:43,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 877 flow [2023-08-27 03:35:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:35:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:35:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 948 transitions. [2023-08-27 03:35:43,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46402349486049926 [2023-08-27 03:35:43,196 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 948 transitions. [2023-08-27 03:35:43,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 948 transitions. [2023-08-27 03:35:43,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:43,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 948 transitions. [2023-08-27 03:35:43,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.33333333333333) internal successors, (948), 9 states have internal predecessors, (948), 0 states have call successors, (0), 0 states 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:35:43,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states 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:35:43,202 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states 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:35:43,202 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 563 flow. Second operand 9 states and 948 transitions. [2023-08-27 03:35:43,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 877 flow [2023-08-27 03:35:43,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 768 flow, removed 6 selfloop flow, removed 14 redundant places. [2023-08-27 03:35:43,256 INFO L231 Difference]: Finished difference. Result has 77 places, 30 transitions, 199 flow [2023-08-27 03:35:43,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=199, PETRI_PLACES=77, PETRI_TRANSITIONS=30} [2023-08-27 03:35:43,257 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-27 03:35:43,257 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 30 transitions, 199 flow [2023-08-27 03:35:43,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:35:43,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:43,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:43,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:35:43,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:43,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1484223736, now seen corresponding path program 1 times [2023-08-27 03:35:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562760237] [2023-08-27 03:35:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:35:44,478 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:35:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:35:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562760237] [2023-08-27 03:35:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562760237] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:35:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:35:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:35:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411232528] [2023-08-27 03:35:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:35:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:35:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:35:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:35:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:35:44,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 227 [2023-08-27 03:35:44,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 30 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 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:35:44,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:35:44,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 227 [2023-08-27 03:35:44,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:35:44,726 INFO L124 PetriNetUnfolderBase]: 200/431 cut-off events. [2023-08-27 03:35:44,726 INFO L125 PetriNetUnfolderBase]: For 912/925 co-relation queries the response was YES. [2023-08-27 03:35:44,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 431 events. 200/431 cut-off events. For 912/925 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1894 event pairs, 33 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1718. Up to 136 conditions per place. [2023-08-27 03:35:44,728 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 32 selfloop transitions, 4 changer transitions 32/72 dead transitions. [2023-08-27 03:35:44,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 580 flow [2023-08-27 03:35:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:35:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:35:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 791 transitions. [2023-08-27 03:35:44,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43557268722466963 [2023-08-27 03:35:44,732 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 791 transitions. [2023-08-27 03:35:44,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 791 transitions. [2023-08-27 03:35:44,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:35:44,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 791 transitions. [2023-08-27 03:35:44,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states 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:35:44,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states 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:35:44,737 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states 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:35:44,737 INFO L175 Difference]: Start difference. First operand has 77 places, 30 transitions, 199 flow. Second operand 8 states and 791 transitions. [2023-08-27 03:35:44,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 580 flow [2023-08-27 03:35:44,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 441 flow, removed 34 selfloop flow, removed 18 redundant places. [2023-08-27 03:35:44,740 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 145 flow [2023-08-27 03:35:44,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-27 03:35:44,741 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-27 03:35:44,741 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 145 flow [2023-08-27 03:35:44,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 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:35:44,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:35:44,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:44,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:35:44,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:35:44,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:35:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1776609140, now seen corresponding path program 2 times [2023-08-27 03:35:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:35:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770257745] [2023-08-27 03:35:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:35:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:35:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:35:44,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:35:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:35:44,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:35:44,868 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:35:44,869 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:35:44,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 03:35:44,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:35:44,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 03:35:44,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 03:35:44,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:35:44,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 03:35:44,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:35:44,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:35:44,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:35:44,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:35:44,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:35:44,873 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:35:44,878 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:35:44,878 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:35:44,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:35:44 BasicIcfg [2023-08-27 03:35:44,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:35:44,937 INFO L158 Benchmark]: Toolchain (without parser) took 16943.23ms. Allocated memory was 400.6MB in the beginning and 1.2GB in the end (delta: 771.8MB). Free memory was 375.6MB in the beginning and 734.3MB in the end (delta: -358.7MB). Peak memory consumption was 413.7MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,938 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 400.6MB. Free memory was 377.0MB in the beginning and 376.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:35:44,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.94ms. Allocated memory is still 400.6MB. Free memory was 375.2MB in the beginning and 350.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.75ms. Allocated memory is still 400.6MB. Free memory was 350.7MB in the beginning and 348.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,938 INFO L158 Benchmark]: Boogie Preprocessor took 36.61ms. Allocated memory is still 400.6MB. Free memory was 348.0MB in the beginning and 345.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,939 INFO L158 Benchmark]: RCFGBuilder took 791.26ms. Allocated memory is still 400.6MB. Free memory was 345.6MB in the beginning and 352.3MB in the end (delta: -6.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,939 INFO L158 Benchmark]: TraceAbstraction took 15537.22ms. Allocated memory was 400.6MB in the beginning and 1.2GB in the end (delta: 771.8MB). Free memory was 351.4MB in the beginning and 734.3MB in the end (delta: -382.9MB). Peak memory consumption was 388.4MB. Max. memory is 16.0GB. [2023-08-27 03:35:44,940 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.11ms. Allocated memory is still 400.6MB. Free memory was 377.0MB in the beginning and 376.9MB in the end (delta: 73.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 518.94ms. Allocated memory is still 400.6MB. Free memory was 375.2MB in the beginning and 350.7MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.75ms. Allocated memory is still 400.6MB. Free memory was 350.7MB in the beginning and 348.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.61ms. Allocated memory is still 400.6MB. Free memory was 348.0MB in the beginning and 345.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 791.26ms. Allocated memory is still 400.6MB. Free memory was 345.6MB in the beginning and 352.3MB in the end (delta: -6.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 15537.22ms. Allocated memory was 400.6MB in the beginning and 1.2GB in the end (delta: 771.8MB). Free memory was 351.4MB in the beginning and 734.3MB in the end (delta: -382.9MB). Peak memory consumption was 388.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 129 PlacesBefore, 42 PlacesAfterwards, 122 TransitionsBefore, 33 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 11736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4332, independent: 4004, independent conditional: 0, independent unconditional: 4004, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1768, independent: 1702, independent conditional: 0, independent unconditional: 1702, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4332, independent: 2302, independent conditional: 0, independent unconditional: 2302, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 1768, unknown conditional: 0, unknown unconditional: 1768] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t14, ((void *)0), P0, ((void *)0))=-2, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t15, ((void *)0), P1, ((void *)0))=-1, t14={5:0}, t15={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t16, ((void *)0), P2, ((void *)0))=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] EXPR 2 __unbuffered_cnt + 1 [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L823] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] EXPR 1 __unbuffered_cnt + 1 [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L849] EXPR 3 __unbuffered_cnt + 1 [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix001.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 18 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: 15.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 479 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 27 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=11, InterpolantAutomatonStates: 68, 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.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:35:44,960 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...