/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:45:32,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:45:32,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:45:32,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:45:32,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:45:32,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:45:32,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:45:32,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:45:32,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:45:32,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:45:32,891 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:45:32,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:45:32,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:45:32,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:45:32,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:45:32,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:45:32,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:45:32,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:45:32,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:45:32,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:45:32,893 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:45:32,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:45:32,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:45:32,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:45:32,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:45:32,894 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:45:32,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:45:32,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:32,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:45:32,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:45:32,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:45:32,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:45:32,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:45:32,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:45:32,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:45:32,896 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:45:33,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:45:33,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:45:33,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:45:33,142 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:45:33,142 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:45:33,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2023-08-27 03:45:34,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:45:34,208 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:45:34,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2023-08-27 03:45:34,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0abf99944/85d6b6a7cd284b06aa1a30d887e05fb4/FLAGdf49bb513 [2023-08-27 03:45:34,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0abf99944/85d6b6a7cd284b06aa1a30d887e05fb4 [2023-08-27 03:45:34,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:45:34,244 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:45:34,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:34,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:45:34,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:45:34,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1e7317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34, skipping insertion in model container [2023-08-27 03:45:34,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,293 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:45:34,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:34,575 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:45:34,592 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:34,596 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:34,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:34,640 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:34,640 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:34,644 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:45:34,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34 WrapperNode [2023-08-27 03:45:34,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:34,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:34,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:45:34,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:45:34,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,685 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 163 [2023-08-27 03:45:34,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:34,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:45:34,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:45:34,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:45:34,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:45:34,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:45:34,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:45:34,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:45:34,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (1/1) ... [2023-08-27 03:45:34,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:45:34,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:45:34,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:45:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:45:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:45:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:45:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:45:34,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:45:34,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:45:34,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:45:34,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:45:34,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:45:34,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:45:34,772 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:45:34,865 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:45:34,866 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:45:35,150 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:45:35,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:45:35,256 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:45:35,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:35 BoogieIcfgContainer [2023-08-27 03:45:35,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:45:35,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:45:35,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:45:35,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:45:35,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:45:34" (1/3) ... [2023-08-27 03:45:35,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d305f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:35, skipping insertion in model container [2023-08-27 03:45:35,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:34" (2/3) ... [2023-08-27 03:45:35,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d305f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:35, skipping insertion in model container [2023-08-27 03:45:35,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:35" (3/3) ... [2023-08-27 03:45:35,264 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-08-27 03:45:35,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:45:35,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:45:35,276 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:45:35,320 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:45:35,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 267 flow [2023-08-27 03:45:35,423 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-08-27 03:45:35,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:35,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-08-27 03:45:35,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 267 flow [2023-08-27 03:45:35,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:35,435 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:45:35,444 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:35,447 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:35,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:35,478 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-08-27 03:45:35,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-08-27 03:45:35,481 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-27 03:45:38,653 INFO L134 LiptonReduction]: Checked pairs total: 11570 [2023-08-27 03:45:38,653 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-08-27 03:45:38,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:45:38,667 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;@748023c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:45:38,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:45:38,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:45:38,676 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:45:38,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:38,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:38,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:45:38,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:38,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash 538860854, now seen corresponding path program 1 times [2023-08-27 03:45:38,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756701459] [2023-08-27 03:45:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756701459] [2023-08-27 03:45:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756701459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:39,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:39,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480972505] [2023-08-27 03:45:39,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:39,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:39,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 232 [2023-08-27 03:45:39,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:39,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 232 [2023-08-27 03:45:39,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:39,447 INFO L124 PetriNetUnfolderBase]: 3035/4813 cut-off events. [2023-08-27 03:45:39,448 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-27 03:45:39,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 4813 events. 3035/4813 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 28276 event pairs, 750 based on Foata normal form. 180/3931 useless extension candidates. Maximal degree in co-relation 9245. Up to 3806 conditions per place. [2023-08-27 03:45:39,473 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 41 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-27 03:45:39,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 196 flow [2023-08-27 03:45:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-27 03:45:39,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186781609195402 [2023-08-27 03:45:39,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-27 03:45:39,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-27 03:45:39,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:39,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-27 03:45:39,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,497 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 77 flow. Second operand 3 states and 361 transitions. [2023-08-27 03:45:39,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 196 flow [2023-08-27 03:45:39,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:39,500 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 74 flow [2023-08-27 03:45:39,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-27 03:45:39,505 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-27 03:45:39,505 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2023-08-27 03:45:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:39,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:45:39,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:45:39,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:39,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash -476733706, now seen corresponding path program 1 times [2023-08-27 03:45:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:39,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179068830] [2023-08-27 03:45:39,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:39,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:39,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179068830] [2023-08-27 03:45:39,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179068830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:39,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:39,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:39,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876766844] [2023-08-27 03:45:39,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:39,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:39,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-27 03:45:39,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:39,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-27 03:45:39,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:39,812 INFO L124 PetriNetUnfolderBase]: 1666/2651 cut-off events. [2023-08-27 03:45:39,813 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-08-27 03:45:39,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5446 conditions, 2651 events. 1666/2651 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13784 event pairs, 702 based on Foata normal form. 0/1890 useless extension candidates. Maximal degree in co-relation 5436. Up to 2292 conditions per place. [2023-08-27 03:45:39,823 INFO L140 encePairwiseOnDemand]: 221/232 looper letters, 41 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-27 03:45:39,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 202 flow [2023-08-27 03:45:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-27 03:45:39,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100574712643678 [2023-08-27 03:45:39,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-27 03:45:39,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-27 03:45:39,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:39,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-27 03:45:39,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,829 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 355 transitions. [2023-08-27 03:45:39,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 202 flow [2023-08-27 03:45:39,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:39,830 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2023-08-27 03:45:39,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-27 03:45:39,831 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-27 03:45:39,831 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2023-08-27 03:45:39,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:39,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:45:39,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:39,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 37163022, now seen corresponding path program 1 times [2023-08-27 03:45:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:39,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424413020] [2023-08-27 03:45:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424413020] [2023-08-27 03:45:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424413020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311497604] [2023-08-27 03:45:39,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:39,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:39,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-27 03:45:39,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:39,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:39,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-27 03:45:39,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:40,069 INFO L124 PetriNetUnfolderBase]: 1241/1984 cut-off events. [2023-08-27 03:45:40,069 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-27 03:45:40,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4707 conditions, 1984 events. 1241/1984 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9907 event pairs, 448 based on Foata normal form. 0/1676 useless extension candidates. Maximal degree in co-relation 4696. Up to 1624 conditions per place. [2023-08-27 03:45:40,077 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 03:45:40,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 210 flow [2023-08-27 03:45:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-27 03:45:40,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838362068965517 [2023-08-27 03:45:40,079 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-27 03:45:40,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-27 03:45:40,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:40,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-27 03:45:40,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,082 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 4 states and 449 transitions. [2023-08-27 03:45:40,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 210 flow [2023-08-27 03:45:40,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:40,084 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 100 flow [2023-08-27 03:45:40,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-27 03:45:40,085 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-27 03:45:40,085 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 100 flow [2023-08-27 03:45:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:40,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:40,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:45:40,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:40,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:40,089 INFO L85 PathProgramCache]: Analyzing trace with hash 37163023, now seen corresponding path program 1 times [2023-08-27 03:45:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011066705] [2023-08-27 03:45:40,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:40,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011066705] [2023-08-27 03:45:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011066705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:40,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935702448] [2023-08-27 03:45:40,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:40,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:40,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-27 03:45:40,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:40,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-27 03:45:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:40,316 INFO L124 PetriNetUnfolderBase]: 512/876 cut-off events. [2023-08-27 03:45:40,316 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-27 03:45:40,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 876 events. 512/876 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3900 event pairs, 219 based on Foata normal form. 40/873 useless extension candidates. Maximal degree in co-relation 2059. Up to 326 conditions per place. [2023-08-27 03:45:40,319 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 49 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-08-27 03:45:40,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 278 flow [2023-08-27 03:45:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-27 03:45:40,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 03:45:40,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-27 03:45:40,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-27 03:45:40,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:40,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-27 03:45:40,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,324 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,324 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 100 flow. Second operand 4 states and 464 transitions. [2023-08-27 03:45:40,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 278 flow [2023-08-27 03:45:40,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:40,326 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 141 flow [2023-08-27 03:45:40,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-08-27 03:45:40,328 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-08-27 03:45:40,328 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 141 flow [2023-08-27 03:45:40,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:40,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:40,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:45:40,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:40,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1657071105, now seen corresponding path program 1 times [2023-08-27 03:45:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086811411] [2023-08-27 03:45:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086811411] [2023-08-27 03:45:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086811411] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:40,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326625599] [2023-08-27 03:45:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:40,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:40,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:40,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 232 [2023-08-27 03:45:40,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:40,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 232 [2023-08-27 03:45:40,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:40,647 INFO L124 PetriNetUnfolderBase]: 513/901 cut-off events. [2023-08-27 03:45:40,647 INFO L125 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2023-08-27 03:45:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 901 events. 513/901 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4041 event pairs, 203 based on Foata normal form. 0/857 useless extension candidates. Maximal degree in co-relation 2340. Up to 478 conditions per place. [2023-08-27 03:45:40,651 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 53 selfloop transitions, 5 changer transitions 3/64 dead transitions. [2023-08-27 03:45:40,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 371 flow [2023-08-27 03:45:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-27 03:45:40,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47844827586206895 [2023-08-27 03:45:40,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-27 03:45:40,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-27 03:45:40,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:40,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-27 03:45:40,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,655 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,655 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 141 flow. Second operand 5 states and 555 transitions. [2023-08-27 03:45:40,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 371 flow [2023-08-27 03:45:40,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 349 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:40,657 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 161 flow [2023-08-27 03:45:40,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 03:45:40,658 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-27 03:45:40,658 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 161 flow [2023-08-27 03:45:40,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:40,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:40,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:40,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:45:40,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:40,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -555048946, now seen corresponding path program 1 times [2023-08-27 03:45:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979360108] [2023-08-27 03:45:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:40,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-27 03:45:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979360108] [2023-08-27 03:45:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979360108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:40,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885506369] [2023-08-27 03:45:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:40,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:40,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:40,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 232 [2023-08-27 03:45:40,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 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-27 03:45:40,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 232 [2023-08-27 03:45:40,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:41,316 INFO L124 PetriNetUnfolderBase]: 1218/1962 cut-off events. [2023-08-27 03:45:41,316 INFO L125 PetriNetUnfolderBase]: For 882/882 co-relation queries the response was YES. [2023-08-27 03:45:41,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5252 conditions, 1962 events. 1218/1962 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8938 event pairs, 135 based on Foata normal form. 14/1934 useless extension candidates. Maximal degree in co-relation 5235. Up to 1121 conditions per place. [2023-08-27 03:45:41,325 INFO L140 encePairwiseOnDemand]: 223/232 looper letters, 109 selfloop transitions, 17 changer transitions 8/134 dead transitions. [2023-08-27 03:45:41,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 134 transitions, 788 flow [2023-08-27 03:45:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:45:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:45:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 873 transitions. [2023-08-27 03:45:41,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41810344827586204 [2023-08-27 03:45:41,327 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 873 transitions. [2023-08-27 03:45:41,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 873 transitions. [2023-08-27 03:45:41,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:41,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 873 transitions. [2023-08-27 03:45:41,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,331 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,331 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 161 flow. Second operand 9 states and 873 transitions. [2023-08-27 03:45:41,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 134 transitions, 788 flow [2023-08-27 03:45:41,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:45:41,335 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 281 flow [2023-08-27 03:45:41,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-27 03:45:41,336 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-08-27 03:45:41,336 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 281 flow [2023-08-27 03:45:41,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 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-27 03:45:41,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:41,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:45:41,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:41,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1654826436, now seen corresponding path program 2 times [2023-08-27 03:45:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482148462] [2023-08-27 03:45:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:41,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482148462] [2023-08-27 03:45:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482148462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:41,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:41,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279186334] [2023-08-27 03:45:41,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:41,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:41,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:41,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 232 [2023-08-27 03:45:41,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:41,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 232 [2023-08-27 03:45:41,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:41,845 INFO L124 PetriNetUnfolderBase]: 1224/1976 cut-off events. [2023-08-27 03:45:41,845 INFO L125 PetriNetUnfolderBase]: For 2073/2073 co-relation queries the response was YES. [2023-08-27 03:45:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6063 conditions, 1976 events. 1224/1976 cut-off events. For 2073/2073 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9094 event pairs, 259 based on Foata normal form. 7/1939 useless extension candidates. Maximal degree in co-relation 6040. Up to 1370 conditions per place. [2023-08-27 03:45:41,860 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 76 selfloop transitions, 11 changer transitions 3/90 dead transitions. [2023-08-27 03:45:41,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 642 flow [2023-08-27 03:45:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-27 03:45:41,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267241379310345 [2023-08-27 03:45:41,862 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-27 03:45:41,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-27 03:45:41,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:41,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-27 03:45:41,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,865 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 281 flow. Second operand 5 states and 495 transitions. [2023-08-27 03:45:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 642 flow [2023-08-27 03:45:41,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 638 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-27 03:45:41,872 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 365 flow [2023-08-27 03:45:41,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2023-08-27 03:45:41,873 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-27 03:45:41,874 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 365 flow [2023-08-27 03:45:41,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:41,874 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] [2023-08-27 03:45:41,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:45:41,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:41,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:41,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1221264501, now seen corresponding path program 1 times [2023-08-27 03:45:41,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:41,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4871503] [2023-08-27 03:45:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:41,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:41,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:41,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4871503] [2023-08-27 03:45:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4871503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:41,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:41,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542994832] [2023-08-27 03:45:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:41,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:41,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:41,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:41,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:41,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-27 03:45:41,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:41,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:41,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-27 03:45:41,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:42,069 INFO L124 PetriNetUnfolderBase]: 596/990 cut-off events. [2023-08-27 03:45:42,070 INFO L125 PetriNetUnfolderBase]: For 1157/1157 co-relation queries the response was YES. [2023-08-27 03:45:42,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 990 events. 596/990 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4672 event pairs, 171 based on Foata normal form. 19/1000 useless extension candidates. Maximal degree in co-relation 3148. Up to 406 conditions per place. [2023-08-27 03:45:42,073 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 35 selfloop transitions, 10 changer transitions 18/66 dead transitions. [2023-08-27 03:45:42,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 66 transitions, 452 flow [2023-08-27 03:45:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-27 03:45:42,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853448275862069 [2023-08-27 03:45:42,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-27 03:45:42,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-27 03:45:42,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:42,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-27 03:45:42,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,086 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 365 flow. Second operand 5 states and 563 transitions. [2023-08-27 03:45:42,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 66 transitions, 452 flow [2023-08-27 03:45:42,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 386 flow, removed 7 selfloop flow, removed 12 redundant places. [2023-08-27 03:45:42,090 INFO L231 Difference]: Finished difference. Result has 56 places, 32 transitions, 164 flow [2023-08-27 03:45:42,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=56, PETRI_TRANSITIONS=32} [2023-08-27 03:45:42,092 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 13 predicate places. [2023-08-27 03:45:42,093 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 164 flow [2023-08-27 03:45:42,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:42,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:42,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:42,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:45:42,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:42,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1305376364, now seen corresponding path program 1 times [2023-08-27 03:45:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357234337] [2023-08-27 03:45:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357234337] [2023-08-27 03:45:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357234337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 03:45:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802400051] [2023-08-27 03:45:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:43,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 03:45:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 03:45:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-27 03:45:43,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 232 [2023-08-27 03:45:43,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 32 transitions, 164 flow. Second operand has 10 states, 10 states have (on average 91.2) internal successors, (912), 10 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:43,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 232 [2023-08-27 03:45:43,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:43,352 INFO L124 PetriNetUnfolderBase]: 284/532 cut-off events. [2023-08-27 03:45:43,352 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2023-08-27 03:45:43,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 532 events. 284/532 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2221 event pairs, 58 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 1795. Up to 190 conditions per place. [2023-08-27 03:45:43,354 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 45 selfloop transitions, 7 changer transitions 24/78 dead transitions. [2023-08-27 03:45:43,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 553 flow [2023-08-27 03:45:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:45:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:45:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 772 transitions. [2023-08-27 03:45:43,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41594827586206895 [2023-08-27 03:45:43,358 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 772 transitions. [2023-08-27 03:45:43,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 772 transitions. [2023-08-27 03:45:43,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:43,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 772 transitions. [2023-08-27 03:45:43,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.5) internal successors, (772), 8 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,362 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,362 INFO L175 Difference]: Start difference. First operand has 56 places, 32 transitions, 164 flow. Second operand 8 states and 772 transitions. [2023-08-27 03:45:43,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 553 flow [2023-08-27 03:45:43,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 485 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-27 03:45:43,365 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 176 flow [2023-08-27 03:45:43,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=176, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-08-27 03:45:43,365 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-27 03:45:43,365 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 176 flow [2023-08-27 03:45:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.2) internal successors, (912), 10 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:43,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:43,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:45:43,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:43,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash -8206432, now seen corresponding path program 2 times [2023-08-27 03:45:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850024312] [2023-08-27 03:45:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850024312] [2023-08-27 03:45:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850024312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:43,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:43,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993241408] [2023-08-27 03:45:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:43,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:43,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:43,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:43,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 232 [2023-08-27 03:45:43,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:43,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 232 [2023-08-27 03:45:43,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:43,643 INFO L124 PetriNetUnfolderBase]: 314/594 cut-off events. [2023-08-27 03:45:43,643 INFO L125 PetriNetUnfolderBase]: For 791/791 co-relation queries the response was YES. [2023-08-27 03:45:43,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 594 events. 314/594 cut-off events. For 791/791 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2730 event pairs, 116 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 2091. Up to 272 conditions per place. [2023-08-27 03:45:43,645 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 27 selfloop transitions, 1 changer transitions 32/62 dead transitions. [2023-08-27 03:45:43,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 439 flow [2023-08-27 03:45:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-27 03:45:43,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4586206896551724 [2023-08-27 03:45:43,646 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-27 03:45:43,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-27 03:45:43,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:43,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-27 03:45:43,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,649 INFO L175 Difference]: Start difference. First operand has 54 places, 35 transitions, 176 flow. Second operand 5 states and 532 transitions. [2023-08-27 03:45:43,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 439 flow [2023-08-27 03:45:43,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 419 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-27 03:45:43,652 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 144 flow [2023-08-27 03:45:43,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2023-08-27 03:45:43,652 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2023-08-27 03:45:43,652 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 144 flow [2023-08-27 03:45:43,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:43,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:43,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:43,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:45:43,653 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:43,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 892355898, now seen corresponding path program 3 times [2023-08-27 03:45:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694546199] [2023-08-27 03:45:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:43,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:45:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:43,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:45:43,754 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:45:43,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:45:43,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:45:43,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:45:43,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:45:43,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:45:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:45:43,757 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:43,760 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:45:43,760 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:45:43,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:45:43 BasicIcfg [2023-08-27 03:45:43,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:45:43,819 INFO L158 Benchmark]: Toolchain (without parser) took 9575.02ms. Allocated memory was 362.8MB in the beginning and 752.9MB in the end (delta: 390.1MB). Free memory was 336.1MB in the beginning and 528.7MB in the end (delta: -192.6MB). Peak memory consumption was 200.3MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,819 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:45:43,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.83ms. Allocated memory is still 362.8MB. Free memory was 336.1MB in the beginning and 312.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 362.8MB. Free memory was 312.7MB in the beginning and 309.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,820 INFO L158 Benchmark]: Boogie Preprocessor took 26.97ms. Allocated memory is still 362.8MB. Free memory was 309.9MB in the beginning and 307.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,820 INFO L158 Benchmark]: RCFGBuilder took 544.63ms. Allocated memory is still 362.8MB. Free memory was 307.8MB in the beginning and 267.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,820 INFO L158 Benchmark]: TraceAbstraction took 8559.79ms. Allocated memory was 362.8MB in the beginning and 752.9MB in the end (delta: 390.1MB). Free memory was 267.2MB in the beginning and 528.7MB in the end (delta: -261.5MB). Peak memory consumption was 131.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:43,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 362.8MB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 399.83ms. Allocated memory is still 362.8MB. Free memory was 336.1MB in the beginning and 312.7MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 362.8MB. Free memory was 312.7MB in the beginning and 309.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.97ms. Allocated memory is still 362.8MB. Free memory was 309.9MB in the beginning and 307.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 544.63ms. Allocated memory is still 362.8MB. Free memory was 307.8MB in the beginning and 267.9MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 8559.79ms. Allocated memory was 362.8MB in the beginning and 752.9MB in the end (delta: 390.1MB). Free memory was 267.2MB in the beginning and 528.7MB in the end (delta: -261.5MB). Peak memory consumption was 131.1MB. 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.2s, 130 PlacesBefore, 43 PlacesAfterwards, 123 TransitionsBefore, 34 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 11570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5183, independent: 4871, independent conditional: 0, independent unconditional: 4871, dependent: 312, dependent conditional: 0, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1792, independent: 1746, independent conditional: 0, independent unconditional: 1746, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5183, independent: 3125, independent conditional: 0, independent unconditional: 3125, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 1792, unknown conditional: 0, unknown unconditional: 1792] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t891, ((void *)0), P0, ((void *)0))=-3, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t892, ((void *)0), P1, ((void *)0))=-2, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t893, ((void *)0), P2, ((void *)0))=-1, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] EXPR 3 __unbuffered_cnt + 1 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L764] EXPR 1 __unbuffered_cnt + 1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L799] EXPR 2 __unbuffered_cnt + 1 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L873] 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", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 843]: 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: 845]: 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, 162 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: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 303 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 21 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:45:43,839 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...