/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:15:44,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:15:44,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:15:44,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:15:44,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:15:44,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:15:44,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:15:44,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:15:44,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:15:44,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:15:44,240 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:15:44,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:15:44,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:15:44,242 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:15:44,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:15:44,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:15:44,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:15:44,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:15:44,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:15:44,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:15:44,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:15:44,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:15:44,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:15:44,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:15:44,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:15:44,246 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:15:44,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:15:44,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:15:44,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:15:44,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:15:44,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:15:44,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:15:44,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:15:44,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:15:44,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:15:44,248 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:15:44,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:15:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:15:44,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:15:44,571 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:15:44,572 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:15:44,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:15:45,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:15:46,048 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:15:46,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:15:46,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f6bfc92/e7c88a662feb4d3ba60fd97c37f9a831/FLAGaba6cac88 [2023-08-26 21:15:46,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f6bfc92/e7c88a662feb4d3ba60fd97c37f9a831 [2023-08-26 21:15:46,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:15:46,079 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:15:46,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:15:46,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:15:46,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:15:46,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a28a0a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46, skipping insertion in model container [2023-08-26 21:15:46,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,121 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:15:46,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:15:46,400 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:15:46,432 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:15:46,434 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:15:46,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:15:46,534 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:15:46,534 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:15:46,540 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:15:46,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46 WrapperNode [2023-08-26 21:15:46,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:15:46,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:15:46,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:15:46,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:15:46,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,614 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-26 21:15:46,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:15:46,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:15:46,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:15:46,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:15:46,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:15:46,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:15:46,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:15:46,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:15:46,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (1/1) ... [2023-08-26 21:15:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:15:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:15:46,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:15:46,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:15:46,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:15:46,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:15:46,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:15:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:15:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:15:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:15:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:15:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:15:46,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:15:46,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:15:46,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:15:46,914 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:15:46,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:15:47,257 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:15:47,436 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:15:47,437 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:15:47,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:47 BoogieIcfgContainer [2023-08-26 21:15:47,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:15:47,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:15:47,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:15:47,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:15:47,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:15:46" (1/3) ... [2023-08-26 21:15:47,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8506c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:47, skipping insertion in model container [2023-08-26 21:15:47,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:15:46" (2/3) ... [2023-08-26 21:15:47,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8506c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:15:47, skipping insertion in model container [2023-08-26 21:15:47,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:15:47" (3/3) ... [2023-08-26 21:15:47,449 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 21:15:47,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:15:47,462 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:15:47,462 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:15:47,527 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:15:47,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 21:15:47,657 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 21:15:47,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:47,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 21:15:47,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 21:15:47,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 116 transitions, 241 flow [2023-08-26 21:15:47,671 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:15:47,680 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 21:15:47,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 21:15:47,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 241 flow [2023-08-26 21:15:47,707 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 21:15:47,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:47,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 21:15:47,710 INFO L119 LiptonReduction]: Number of co-enabled transitions 2880 [2023-08-26 21:15:51,291 INFO L134 LiptonReduction]: Checked pairs total: 11026 [2023-08-26 21:15:51,291 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-26 21:15:51,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:15:51,311 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;@6fbcaad5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:15:51,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:15:51,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:15:51,313 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-26 21:15:51,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:15:51,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:51,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 21:15:51,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:15:51,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash 544650, now seen corresponding path program 1 times [2023-08-26 21:15:51,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:51,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359787156] [2023-08-26 21:15:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359787156] [2023-08-26 21:15:51,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359787156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003609937] [2023-08-26 21:15:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:51,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:51,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-26 21:15:51,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:51,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:51,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-26 21:15:51,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:52,140 INFO L124 PetriNetUnfolderBase]: 1764/2931 cut-off events. [2023-08-26 21:15:52,141 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-26 21:15:52,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 2931 events. 1764/2931 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17980 event pairs, 224 based on Foata normal form. 0/2330 useless extension candidates. Maximal degree in co-relation 5562. Up to 2189 conditions per place. [2023-08-26 21:15:52,167 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 38 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-26 21:15:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 187 flow [2023-08-26 21:15:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-26 21:15:52,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948604992657856 [2023-08-26 21:15:52,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-26 21:15:52,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-26 21:15:52,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:52,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-26 21:15:52,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,201 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-26 21:15:52,202 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-26 21:15:52,204 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 337 transitions. [2023-08-26 21:15:52,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 187 flow [2023-08-26 21:15:52,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:15:52,210 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-26 21:15:52,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 21:15:52,215 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-26 21:15:52,215 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-26 21:15:52,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:52,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:15:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:15:52,217 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-26 21:15:52,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash -953790891, now seen corresponding path program 1 times [2023-08-26 21:15:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:52,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590655963] [2023-08-26 21:15:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:52,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590655963] [2023-08-26 21:15:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590655963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217801475] [2023-08-26 21:15:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:52,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:52,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:52,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:52,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-26 21:15:52,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:52,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-26 21:15:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:52,623 INFO L124 PetriNetUnfolderBase]: 1395/2151 cut-off events. [2023-08-26 21:15:52,624 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-26 21:15:52,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 2151 events. 1395/2151 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10645 event pairs, 463 based on Foata normal form. 0/1642 useless extension candidates. Maximal degree in co-relation 4459. Up to 1562 conditions per place. [2023-08-26 21:15:52,637 INFO L140 encePairwiseOnDemand]: 217/227 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-26 21:15:52,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 198 flow [2023-08-26 21:15:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-26 21:15:52,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48751835535976507 [2023-08-26 21:15:52,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-26 21:15:52,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-26 21:15:52,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:52,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-26 21:15:52,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,646 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-26 21:15:52,647 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-26 21:15:52,647 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 332 transitions. [2023-08-26 21:15:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 198 flow [2023-08-26 21:15:52,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:52,650 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-26 21:15:52,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-26 21:15:52,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-26 21:15:52,652 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-26 21:15:52,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:52,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:15:52,660 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-26 21:15:52,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1459337495, now seen corresponding path program 1 times [2023-08-26 21:15:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:52,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188786587] [2023-08-26 21:15:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188786587] [2023-08-26 21:15:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188786587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700163649] [2023-08-26 21:15:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:52,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 227 [2023-08-26 21:15:52,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:52,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:52,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 227 [2023-08-26 21:15:52,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:53,460 INFO L124 PetriNetUnfolderBase]: 3487/5455 cut-off events. [2023-08-26 21:15:53,461 INFO L125 PetriNetUnfolderBase]: For 496/552 co-relation queries the response was YES. [2023-08-26 21:15:53,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12851 conditions, 5455 events. 3487/5455 cut-off events. For 496/552 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 31166 event pairs, 1192 based on Foata normal form. 0/4854 useless extension candidates. Maximal degree in co-relation 12840. Up to 2603 conditions per place. [2023-08-26 21:15:53,495 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 45 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2023-08-26 21:15:53,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 277 flow [2023-08-26 21:15:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-08-26 21:15:53,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46255506607929514 [2023-08-26 21:15:53,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-08-26 21:15:53,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-08-26 21:15:53,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:53,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-08-26 21:15:53,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:53,500 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-26 21:15:53,500 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-26 21:15:53,500 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 3 states and 315 transitions. [2023-08-26 21:15:53,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 277 flow [2023-08-26 21:15:53,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:53,503 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 158 flow [2023-08-26 21:15:53,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-08-26 21:15:53,504 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-26 21:15:53,504 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 158 flow [2023-08-26 21:15:53,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:53,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:53,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:53,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:15:53,505 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-26 21:15:53,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2005178835, now seen corresponding path program 1 times [2023-08-26 21:15:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005628509] [2023-08-26 21:15:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:53,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005628509] [2023-08-26 21:15:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005628509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:53,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:15:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627773921] [2023-08-26 21:15:53,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:53,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:53,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:53,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 227 [2023-08-26 21:15:53,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:53,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:53,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 227 [2023-08-26 21:15:53,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:54,250 INFO L124 PetriNetUnfolderBase]: 3330/5221 cut-off events. [2023-08-26 21:15:54,250 INFO L125 PetriNetUnfolderBase]: For 2592/2636 co-relation queries the response was YES. [2023-08-26 21:15:54,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14532 conditions, 5221 events. 3330/5221 cut-off events. For 2592/2636 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 29363 event pairs, 702 based on Foata normal form. 32/4817 useless extension candidates. Maximal degree in co-relation 14518. Up to 2072 conditions per place. [2023-08-26 21:15:54,287 INFO L140 encePairwiseOnDemand]: 219/227 looper letters, 62 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2023-08-26 21:15:54,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 420 flow [2023-08-26 21:15:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2023-08-26 21:15:54,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45484581497797355 [2023-08-26 21:15:54,289 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2023-08-26 21:15:54,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2023-08-26 21:15:54,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:54,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2023-08-26 21:15:54,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:54,292 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-26 21:15:54,293 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-26 21:15:54,293 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 158 flow. Second operand 4 states and 413 transitions. [2023-08-26 21:15:54,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 420 flow [2023-08-26 21:15:54,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:54,305 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 200 flow [2023-08-26 21:15:54,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-26 21:15:54,306 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 21:15:54,306 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 200 flow [2023-08-26 21:15:54,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:54,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:54,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:54,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:15:54,307 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-26 21:15:54,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:54,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2032540048, now seen corresponding path program 1 times [2023-08-26 21:15:54,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:54,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420599298] [2023-08-26 21:15:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420599298] [2023-08-26 21:15:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420599298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:54,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:15:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353826953] [2023-08-26 21:15:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:54,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:15:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:15:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:15:54,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-26 21:15:54,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:54,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:54,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-26 21:15:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:54,942 INFO L124 PetriNetUnfolderBase]: 2921/4790 cut-off events. [2023-08-26 21:15:54,942 INFO L125 PetriNetUnfolderBase]: For 3629/3707 co-relation queries the response was YES. [2023-08-26 21:15:54,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13771 conditions, 4790 events. 2921/4790 cut-off events. For 3629/3707 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 29028 event pairs, 1042 based on Foata normal form. 38/4390 useless extension candidates. Maximal degree in co-relation 13754. Up to 4080 conditions per place. [2023-08-26 21:15:54,971 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 49 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2023-08-26 21:15:54,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 406 flow [2023-08-26 21:15:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:15:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:15:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-26 21:15:54,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47577092511013214 [2023-08-26 21:15:54,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-26 21:15:54,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-26 21:15:54,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:54,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-26 21:15:54,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:54,976 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-26 21:15:54,976 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-26 21:15:54,976 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 200 flow. Second operand 3 states and 324 transitions. [2023-08-26 21:15:54,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 406 flow [2023-08-26 21:15:54,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:54,986 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 268 flow [2023-08-26 21:15:54,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-08-26 21:15:54,988 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-26 21:15:54,988 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 268 flow [2023-08-26 21:15:54,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:54,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:54,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:54,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:15:54,989 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:15:54,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash -505302838, now seen corresponding path program 1 times [2023-08-26 21:15:54,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:54,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529301941] [2023-08-26 21:15:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:54,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529301941] [2023-08-26 21:15:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529301941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:55,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:15:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110015643] [2023-08-26 21:15:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:55,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:55,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:55,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:55,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-26 21:15:55,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:55,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:55,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-26 21:15:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:55,566 INFO L124 PetriNetUnfolderBase]: 2462/3896 cut-off events. [2023-08-26 21:15:55,566 INFO L125 PetriNetUnfolderBase]: For 3954/4150 co-relation queries the response was YES. [2023-08-26 21:15:55,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11691 conditions, 3896 events. 2462/3896 cut-off events. For 3954/4150 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22177 event pairs, 633 based on Foata normal form. 50/3561 useless extension candidates. Maximal degree in co-relation 11672. Up to 2374 conditions per place. [2023-08-26 21:15:55,594 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 54 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-26 21:15:55,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 69 transitions, 484 flow [2023-08-26 21:15:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-26 21:15:55,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46255506607929514 [2023-08-26 21:15:55,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-26 21:15:55,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-26 21:15:55,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:55,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-26 21:15:55,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:55,600 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-26 21:15:55,601 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-26 21:15:55,601 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 268 flow. Second operand 4 states and 420 transitions. [2023-08-26 21:15:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 69 transitions, 484 flow [2023-08-26 21:15:55,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:55,606 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 257 flow [2023-08-26 21:15:55,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-08-26 21:15:55,607 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-26 21:15:55,607 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 257 flow [2023-08-26 21:15:55,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:55,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:55,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:55,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:15:55,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:15:55,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1415767028, now seen corresponding path program 1 times [2023-08-26 21:15:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:55,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856379469] [2023-08-26 21:15:55,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:55,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:55,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856379469] [2023-08-26 21:15:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856379469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:55,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:15:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668726313] [2023-08-26 21:15:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:55,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:55,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:55,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:55,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 227 [2023-08-26 21:15:55,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:55,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:55,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 227 [2023-08-26 21:15:55,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:56,053 INFO L124 PetriNetUnfolderBase]: 1760/3009 cut-off events. [2023-08-26 21:15:56,053 INFO L125 PetriNetUnfolderBase]: For 2976/3107 co-relation queries the response was YES. [2023-08-26 21:15:56,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9028 conditions, 3009 events. 1760/3009 cut-off events. For 2976/3107 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18079 event pairs, 440 based on Foata normal form. 290/2910 useless extension candidates. Maximal degree in co-relation 9008. Up to 1993 conditions per place. [2023-08-26 21:15:56,091 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 78 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2023-08-26 21:15:56,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 667 flow [2023-08-26 21:15:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:15:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:15:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2023-08-26 21:15:56,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46079295154185024 [2023-08-26 21:15:56,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2023-08-26 21:15:56,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2023-08-26 21:15:56,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:56,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2023-08-26 21:15:56,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,097 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-26 21:15:56,097 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-26 21:15:56,097 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 257 flow. Second operand 5 states and 523 transitions. [2023-08-26 21:15:56,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 97 transitions, 667 flow [2023-08-26 21:15:56,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:56,102 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 303 flow [2023-08-26 21:15:56,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-26 21:15:56,103 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-08-26 21:15:56,103 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 303 flow [2023-08-26 21:15:56,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:56,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:56,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:15:56,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:15:56,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1263117009, now seen corresponding path program 1 times [2023-08-26 21:15:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743574530] [2023-08-26 21:15:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743574530] [2023-08-26 21:15:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743574530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:15:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82906618] [2023-08-26 21:15:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:56,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:56,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-26 21:15:56,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:56,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-26 21:15:56,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:56,454 INFO L124 PetriNetUnfolderBase]: 1315/2286 cut-off events. [2023-08-26 21:15:56,454 INFO L125 PetriNetUnfolderBase]: For 3000/3115 co-relation queries the response was YES. [2023-08-26 21:15:56,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7795 conditions, 2286 events. 1315/2286 cut-off events. For 3000/3115 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13115 event pairs, 228 based on Foata normal form. 34/2265 useless extension candidates. Maximal degree in co-relation 7772. Up to 1076 conditions per place. [2023-08-26 21:15:56,469 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 65 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2023-08-26 21:15:56,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 617 flow [2023-08-26 21:15:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-26 21:15:56,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47687224669603523 [2023-08-26 21:15:56,472 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-26 21:15:56,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-26 21:15:56,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:56,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-26 21:15:56,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,474 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-26 21:15:56,475 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-26 21:15:56,475 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 303 flow. Second operand 4 states and 433 transitions. [2023-08-26 21:15:56,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 617 flow [2023-08-26 21:15:56,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:56,483 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 345 flow [2023-08-26 21:15:56,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-08-26 21:15:56,484 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-26 21:15:56,484 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 345 flow [2023-08-26 21:15:56,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:56,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:56,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:15:56,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:15:56,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash 823162569, now seen corresponding path program 1 times [2023-08-26 21:15:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788929666] [2023-08-26 21:15:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788929666] [2023-08-26 21:15:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788929666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:15:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572072552] [2023-08-26 21:15:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:56,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:15:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:56,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:15:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:15:56,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 227 [2023-08-26 21:15:56,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:56,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 227 [2023-08-26 21:15:56,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:56,939 INFO L124 PetriNetUnfolderBase]: 886/1611 cut-off events. [2023-08-26 21:15:56,939 INFO L125 PetriNetUnfolderBase]: For 2849/2910 co-relation queries the response was YES. [2023-08-26 21:15:56,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 1611 events. 886/1611 cut-off events. For 2849/2910 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9244 event pairs, 112 based on Foata normal form. 135/1693 useless extension candidates. Maximal degree in co-relation 5924. Up to 404 conditions per place. [2023-08-26 21:15:56,947 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 94 selfloop transitions, 15 changer transitions 3/123 dead transitions. [2023-08-26 21:15:56,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 900 flow [2023-08-26 21:15:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:15:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:15:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2023-08-26 21:15:56,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594084329767149 [2023-08-26 21:15:56,950 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2023-08-26 21:15:56,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2023-08-26 21:15:56,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:56,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2023-08-26 21:15:56,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,954 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-26 21:15:56,954 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-26 21:15:56,954 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 345 flow. Second operand 7 states and 730 transitions. [2023-08-26 21:15:56,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 900 flow [2023-08-26 21:15:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 870 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 21:15:56,965 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 385 flow [2023-08-26 21:15:56,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-26 21:15:56,965 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-08-26 21:15:56,966 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 385 flow [2023-08-26 21:15:56,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:56,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:56,966 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-26 21:15:56,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:15:56,966 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-26 21:15:56,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 893990567, now seen corresponding path program 1 times [2023-08-26 21:15:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588187768] [2023-08-26 21:15:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588187768] [2023-08-26 21:15:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588187768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:15:57,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105804353] [2023-08-26 21:15:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:57,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:15:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:15:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:15:57,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 227 [2023-08-26 21:15:57,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:57,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:57,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 227 [2023-08-26 21:15:57,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:57,510 INFO L124 PetriNetUnfolderBase]: 1761/3008 cut-off events. [2023-08-26 21:15:57,510 INFO L125 PetriNetUnfolderBase]: For 8664/8664 co-relation queries the response was YES. [2023-08-26 21:15:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 3008 events. 1761/3008 cut-off events. For 8664/8664 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17350 event pairs, 326 based on Foata normal form. 13/2948 useless extension candidates. Maximal degree in co-relation 12510. Up to 1355 conditions per place. [2023-08-26 21:15:57,530 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 102 selfloop transitions, 18 changer transitions 4/124 dead transitions. [2023-08-26 21:15:57,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 1101 flow [2023-08-26 21:15:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:15:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:15:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-26 21:15:57,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46806167400881055 [2023-08-26 21:15:57,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-26 21:15:57,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-26 21:15:57,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:57,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-26 21:15:57,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:57,535 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-26 21:15:57,535 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-26 21:15:57,535 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 385 flow. Second operand 4 states and 425 transitions. [2023-08-26 21:15:57,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 1101 flow [2023-08-26 21:15:57,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 124 transitions, 1024 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 21:15:57,569 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 493 flow [2023-08-26 21:15:57,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2023-08-26 21:15:57,570 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 23 predicate places. [2023-08-26 21:15:57,570 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 493 flow [2023-08-26 21:15:57,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:57,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:57,570 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-26 21:15:57,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:15:57,571 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-26 21:15:57,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1628009412, now seen corresponding path program 1 times [2023-08-26 21:15:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462776757] [2023-08-26 21:15:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462776757] [2023-08-26 21:15:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462776757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:57,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:57,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:15:57,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687597039] [2023-08-26 21:15:57,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:57,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:15:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:57,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:15:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:15:57,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 227 [2023-08-26 21:15:57,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:57,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:57,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 227 [2023-08-26 21:15:57,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:58,131 INFO L124 PetriNetUnfolderBase]: 1159/2059 cut-off events. [2023-08-26 21:15:58,131 INFO L125 PetriNetUnfolderBase]: For 5272/5368 co-relation queries the response was YES. [2023-08-26 21:15:58,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8189 conditions, 2059 events. 1159/2059 cut-off events. For 5272/5368 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12662 event pairs, 116 based on Foata normal form. 64/2099 useless extension candidates. Maximal degree in co-relation 8159. Up to 542 conditions per place. [2023-08-26 21:15:58,142 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 57 selfloop transitions, 17 changer transitions 51/133 dead transitions. [2023-08-26 21:15:58,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 133 transitions, 1173 flow [2023-08-26 21:15:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:15:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:15:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2023-08-26 21:15:58,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.447870778267254 [2023-08-26 21:15:58,145 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2023-08-26 21:15:58,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2023-08-26 21:15:58,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:58,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2023-08-26 21:15:58,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:58,150 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-26 21:15:58,151 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-26 21:15:58,151 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 493 flow. Second operand 9 states and 915 transitions. [2023-08-26 21:15:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 133 transitions, 1173 flow [2023-08-26 21:15:58,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 1133 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-26 21:15:58,195 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 371 flow [2023-08-26 21:15:58,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=371, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-08-26 21:15:58,196 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-26 21:15:58,196 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 371 flow [2023-08-26 21:15:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.66666666666667) internal successors, (568), 6 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:58,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:58,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:15:58,197 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-26 21:15:58,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 623734215, now seen corresponding path program 1 times [2023-08-26 21:15:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92108620] [2023-08-26 21:15:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:15:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:15:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:15:58,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92108620] [2023-08-26 21:15:58,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92108620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:15:58,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:15:58,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:15:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851721050] [2023-08-26 21:15:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:15:58,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:15:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:15:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:15:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:15:58,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 227 [2023-08-26 21:15:58,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 371 flow. Second operand has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:58,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:15:58,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 227 [2023-08-26 21:15:58,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:15:59,260 INFO L124 PetriNetUnfolderBase]: 666/1273 cut-off events. [2023-08-26 21:15:59,260 INFO L125 PetriNetUnfolderBase]: For 4781/4826 co-relation queries the response was YES. [2023-08-26 21:15:59,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5728 conditions, 1273 events. 666/1273 cut-off events. For 4781/4826 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7556 event pairs, 118 based on Foata normal form. 12/1274 useless extension candidates. Maximal degree in co-relation 5694. Up to 418 conditions per place. [2023-08-26 21:15:59,266 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 54 selfloop transitions, 5 changer transitions 55/122 dead transitions. [2023-08-26 21:15:59,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 1213 flow [2023-08-26 21:15:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:15:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:15:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 674 transitions. [2023-08-26 21:15:59,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42416614222781623 [2023-08-26 21:15:59,269 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 674 transitions. [2023-08-26 21:15:59,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 674 transitions. [2023-08-26 21:15:59,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:15:59,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 674 transitions. [2023-08-26 21:15:59,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:59,272 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-26 21:15:59,273 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-26 21:15:59,273 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 371 flow. Second operand 7 states and 674 transitions. [2023-08-26 21:15:59,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 1213 flow [2023-08-26 21:15:59,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 122 transitions, 954 flow, removed 34 selfloop flow, removed 13 redundant places. [2023-08-26 21:15:59,287 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 289 flow [2023-08-26 21:15:59,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2023-08-26 21:15:59,288 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-08-26 21:15:59,288 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 289 flow [2023-08-26 21:15:59,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:15:59,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:15:59,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:59,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:15:59,289 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-26 21:15:59,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:15:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1142478821, now seen corresponding path program 2 times [2023-08-26 21:15:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:15:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983793328] [2023-08-26 21:15:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:15:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:15:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:15:59,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:15:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:15:59,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:15:59,433 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:15:59,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:15:59,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-26 21:15:59,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:15:59,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:15:59,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:15:59,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:15:59,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-26 21:15:59,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:15:59,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:15:59,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:15:59,437 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:15:59,442 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:15:59,442 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:15:59,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:15:59 BasicIcfg [2023-08-26 21:15:59,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:15:59,519 INFO L158 Benchmark]: Toolchain (without parser) took 13440.58ms. Allocated memory was 367.0MB in the beginning and 690.0MB in the end (delta: 323.0MB). Free memory was 341.7MB in the beginning and 498.9MB in the end (delta: -157.2MB). Peak memory consumption was 167.9MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,519 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 367.0MB. Free memory was 344.7MB in the beginning and 344.5MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:15:59,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.85ms. Allocated memory is still 367.0MB. Free memory was 341.7MB in the beginning and 318.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.27ms. Allocated memory is still 367.0MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,520 INFO L158 Benchmark]: Boogie Preprocessor took 59.16ms. Allocated memory is still 367.0MB. Free memory was 316.0MB in the beginning and 313.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,520 INFO L158 Benchmark]: RCFGBuilder took 764.01ms. Allocated memory is still 367.0MB. Free memory was 313.9MB in the beginning and 274.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,520 INFO L158 Benchmark]: TraceAbstraction took 12076.57ms. Allocated memory was 367.0MB in the beginning and 690.0MB in the end (delta: 323.0MB). Free memory was 273.6MB in the beginning and 498.9MB in the end (delta: -225.4MB). Peak memory consumption was 100.8MB. Max. memory is 16.0GB. [2023-08-26 21:15:59,524 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.12ms. Allocated memory is still 367.0MB. Free memory was 344.7MB in the beginning and 344.5MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 461.85ms. Allocated memory is still 367.0MB. Free memory was 341.7MB in the beginning and 318.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.27ms. Allocated memory is still 367.0MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.16ms. Allocated memory is still 367.0MB. Free memory was 316.0MB in the beginning and 313.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 764.01ms. Allocated memory is still 367.0MB. Free memory was 313.9MB in the beginning and 274.1MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 12076.57ms. Allocated memory was 367.0MB in the beginning and 690.0MB in the end (delta: 323.0MB). Free memory was 273.6MB in the beginning and 498.9MB in the end (delta: -225.4MB). Peak memory consumption was 100.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 123 PlacesBefore, 40 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2880 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 108 TotalNumberOfCompositions, 11026 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3565, independent: 3260, independent conditional: 0, independent unconditional: 3260, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1643, independent: 1596, independent conditional: 0, independent unconditional: 1596, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3565, independent: 1664, independent conditional: 0, independent unconditional: 1664, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 1643, unknown conditional: 0, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-3, t745={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] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-2, t745={5:0}, t746={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] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t747, ((void *)0), P2, ((void *)0))=-1, t745={5:0}, t746={6:0}, t747={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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L772] 2 x = 2 VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=2, 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] [L775] 2 y = 1 VAL [__unbuffered_cnt=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$$choice0=0, weak$$choice2=0, x=2, 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] [L792] 3 y = 2 VAL [__unbuffered_cnt=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=2, y=2, 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] [L778] 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) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 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 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 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_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=2, y=2, 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] [L785] EXPR 2 __unbuffered_cnt + 1 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, y=2, 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] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 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) [L803] 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)) [L804] 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)) [L805] 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)) [L806] 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)) [L807] 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)) [L808] 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)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=2, y=2, 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] [L814] 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) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 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_p2_EAX=2, __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=2, y=2, 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] [L758] 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) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 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 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 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_p2_EAX=2, __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=2, y=2, 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] [L765] EXPR 1 __unbuffered_cnt + 1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L821] EXPR 3 __unbuffered_cnt + 1 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice2=1, x=2, y=2, 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] [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix028_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=2, y=2, 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: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 765]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 152 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: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 16 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-26 21:15:59,549 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...