/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/thin002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:59:09,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:59:09,439 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:59:09,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:59:09,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:59:09,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:59:09,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:59:09,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:59:09,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:59:09,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:59:09,494 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:59:09,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:59:09,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:59:09,495 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:59:09,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:59:09,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:59:09,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:59:09,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:59:09,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:59:09,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:59:09,498 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:59:09,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:59:09,498 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:59:09,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:59:09,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:59:09,499 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:59:09,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:59:09,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:59:09,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:59:09,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:59:09,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:59:09,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:59:09,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:59:09,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:59:09,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:59:09,503 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:59:09,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:59:09,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:59:09,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:59:09,834 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:59:09,835 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:59:09,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-27 03:59:11,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:59:11,319 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:59:11,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-27 03:59:11,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737183e51/6fbeaa6b21de4a7884d74a6359e9825d/FLAG24e5e8661 [2023-08-27 03:59:11,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737183e51/6fbeaa6b21de4a7884d74a6359e9825d [2023-08-27 03:59:11,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:59:11,349 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:59:11,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:59:11,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:59:11,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:59:11,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6fac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11, skipping insertion in model container [2023-08-27 03:59:11,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,400 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:59:11,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:59:11,726 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:59:11,749 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:59:11,751 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:59:11,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:59:11,809 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:59:11,809 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:59:11,815 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:59:11,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11 WrapperNode [2023-08-27 03:59:11,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:59:11,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:59:11,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:59:11,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:59:11,823 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:59:11" (1/1) ... [2023-08-27 03:59:11,856 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:59:11" (1/1) ... [2023-08-27 03:59:11,891 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 208 [2023-08-27 03:59:11,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:59:11,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:59:11,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:59:11,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:59:11,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:59:11,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:59:11,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:59:11,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:59:11,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (1/1) ... [2023-08-27 03:59:11,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:59:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:59:11,997 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:59:12,001 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:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 03:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:59:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:59:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:59:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:59:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:59:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:59:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:59:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:59:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:59:12,026 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:59:12,154 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:59:12,156 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:59:12,641 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:59:12,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:59:12,837 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:59:12,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:59:12 BoogieIcfgContainer [2023-08-27 03:59:12,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:59:12,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:59:12,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:59:12,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:59:12,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:59:11" (1/3) ... [2023-08-27 03:59:12,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17744698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:59:12, skipping insertion in model container [2023-08-27 03:59:12,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:59:11" (2/3) ... [2023-08-27 03:59:12,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17744698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:59:12, skipping insertion in model container [2023-08-27 03:59:12,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:59:12" (3/3) ... [2023-08-27 03:59:12,850 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-08-27 03:59:12,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:59:12,863 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:59:12,863 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:59:12,924 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:59:12,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 161 transitions, 342 flow [2023-08-27 03:59:13,013 INFO L124 PetriNetUnfolderBase]: 3/157 cut-off events. [2023-08-27 03:59:13,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:59:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 3/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-27 03:59:13,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 161 transitions, 342 flow [2023-08-27 03:59:13,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 157 transitions, 326 flow [2023-08-27 03:59:13,029 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:59:13,042 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 157 transitions, 326 flow [2023-08-27 03:59:13,049 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 157 transitions, 326 flow [2023-08-27 03:59:13,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 157 transitions, 326 flow [2023-08-27 03:59:13,099 INFO L124 PetriNetUnfolderBase]: 3/157 cut-off events. [2023-08-27 03:59:13,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:59:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 3/157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-27 03:59:13,103 INFO L119 LiptonReduction]: Number of co-enabled transitions 4066 [2023-08-27 03:59:20,468 INFO L134 LiptonReduction]: Checked pairs total: 15260 [2023-08-27 03:59:20,468 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-27 03:59:20,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:59:20,485 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;@7acbed24, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:59:20,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:59:20,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:59:20,488 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:59:20,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:59:20,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:20,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:59:20,489 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:20,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash 891988132, now seen corresponding path program 1 times [2023-08-27 03:59:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411141710] [2023-08-27 03:59:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:20,732 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:59:20,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411141710] [2023-08-27 03:59:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411141710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:59:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994623993] [2023-08-27 03:59:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:20,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:59:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:59:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:59:20,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-27 03:59:20,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:20,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:20,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-27 03:59:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:22,863 INFO L124 PetriNetUnfolderBase]: 12365/17258 cut-off events. [2023-08-27 03:59:22,864 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2023-08-27 03:59:22,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34728 conditions, 17258 events. 12365/17258 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 107176 event pairs, 5603 based on Foata normal form. 700/10983 useless extension candidates. Maximal degree in co-relation 34716. Up to 16723 conditions per place. [2023-08-27 03:59:23,013 INFO L140 encePairwiseOnDemand]: 282/297 looper letters, 48 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 03:59:23,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 239 flow [2023-08-27 03:59:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:59:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:59:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-08-27 03:59:23,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162738496071829 [2023-08-27 03:59:23,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-08-27 03:59:23,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-08-27 03:59:23,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:23,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-08-27 03:59:23,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:23,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:23,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:23,046 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 460 transitions. [2023-08-27 03:59:23,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 239 flow [2023-08-27 03:59:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:59:23,051 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 131 flow [2023-08-27 03:59:23,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-27 03:59:23,056 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 03:59:23,056 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 131 flow [2023-08-27 03:59:23,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:23,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:23,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:23,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:59:23,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:23,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1783069156, now seen corresponding path program 1 times [2023-08-27 03:59:23,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:23,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656019598] [2023-08-27 03:59:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:23,302 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:59:23,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:23,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656019598] [2023-08-27 03:59:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656019598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:23,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:23,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:59:23,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181226427] [2023-08-27 03:59:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:23,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:59:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:59:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:59:23,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 297 [2023-08-27 03:59:23,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:23,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:23,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 297 [2023-08-27 03:59:23,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:24,841 INFO L124 PetriNetUnfolderBase]: 8972/13088 cut-off events. [2023-08-27 03:59:24,841 INFO L125 PetriNetUnfolderBase]: For 1838/2245 co-relation queries the response was YES. [2023-08-27 03:59:24,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32314 conditions, 13088 events. 8972/13088 cut-off events. For 1838/2245 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 89977 event pairs, 2903 based on Foata normal form. 8/9722 useless extension candidates. Maximal degree in co-relation 32303. Up to 8808 conditions per place. [2023-08-27 03:59:24,933 INFO L140 encePairwiseOnDemand]: 294/297 looper letters, 52 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-27 03:59:24,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 304 flow [2023-08-27 03:59:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:59:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:59:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-27 03:59:24,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-27 03:59:24,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-27 03:59:24,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-27 03:59:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:24,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-27 03:59:24,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:24,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:24,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 297.0) internal successors, (1188), 4 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:24,940 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 131 flow. Second operand 3 states and 459 transitions. [2023-08-27 03:59:24,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 304 flow [2023-08-27 03:59:24,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:59:24,942 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 128 flow [2023-08-27 03:59:24,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-27 03:59:24,943 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 03:59:24,943 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 128 flow [2023-08-27 03:59:24,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:24,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:24,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:59:24,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:24,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 616912588, now seen corresponding path program 1 times [2023-08-27 03:59:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383703086] [2023-08-27 03:59:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:25,006 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:59:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383703086] [2023-08-27 03:59:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383703086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:25,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:59:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318387906] [2023-08-27 03:59:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:25,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:59:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:59:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:59:25,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-27 03:59:25,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:25,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:25,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-27 03:59:25,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:25,980 INFO L124 PetriNetUnfolderBase]: 5831/8226 cut-off events. [2023-08-27 03:59:25,980 INFO L125 PetriNetUnfolderBase]: For 1268/1268 co-relation queries the response was YES. [2023-08-27 03:59:25,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20560 conditions, 8226 events. 5831/8226 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 45848 event pairs, 2134 based on Foata normal form. 0/6364 useless extension candidates. Maximal degree in co-relation 20548. Up to 7798 conditions per place. [2023-08-27 03:59:26,014 INFO L140 encePairwiseOnDemand]: 288/297 looper letters, 42 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-27 03:59:26,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 242 flow [2023-08-27 03:59:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:59:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:59:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-08-27 03:59:26,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48737373737373735 [2023-08-27 03:59:26,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-08-27 03:59:26,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-08-27 03:59:26,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:26,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-08-27 03:59:26,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,021 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,021 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 128 flow. Second operand 4 states and 579 transitions. [2023-08-27 03:59:26,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 242 flow [2023-08-27 03:59:26,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:59:26,024 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 118 flow [2023-08-27 03:59:26,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-27 03:59:26,025 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-27 03:59:26,025 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 118 flow [2023-08-27 03:59:26,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:26,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:26,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:59:26,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:26,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1588368269, now seen corresponding path program 1 times [2023-08-27 03:59:26,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:26,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129977084] [2023-08-27 03:59:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:26,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:26,067 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:59:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129977084] [2023-08-27 03:59:26,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129977084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:26,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:26,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:59:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710395449] [2023-08-27 03:59:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:26,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:59:26,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:59:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:59:26,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-27 03:59:26,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:26,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-27 03:59:26,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:26,417 INFO L124 PetriNetUnfolderBase]: 2111/3209 cut-off events. [2023-08-27 03:59:26,417 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2023-08-27 03:59:26,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7923 conditions, 3209 events. 2111/3209 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16268 event pairs, 603 based on Foata normal form. 76/2834 useless extension candidates. Maximal degree in co-relation 7911. Up to 2122 conditions per place. [2023-08-27 03:59:26,431 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 54 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-27 03:59:26,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 322 flow [2023-08-27 03:59:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:59:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:59:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-08-27 03:59:26,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016835016835017 [2023-08-27 03:59:26,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-08-27 03:59:26,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-08-27 03:59:26,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:26,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-08-27 03:59:26,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,447 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 118 flow. Second operand 4 states and 596 transitions. [2023-08-27 03:59:26,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 322 flow [2023-08-27 03:59:26,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:59:26,451 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 172 flow [2023-08-27 03:59:26,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-27 03:59:26,453 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-27 03:59:26,453 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 172 flow [2023-08-27 03:59:26,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:26,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:26,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:59:26,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:26,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1482499679, now seen corresponding path program 1 times [2023-08-27 03:59:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697466908] [2023-08-27 03:59:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:26,537 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:59:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697466908] [2023-08-27 03:59:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697466908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:59:26,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37398939] [2023-08-27 03:59:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:26,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:59:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:59:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:59:26,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-27 03:59:26,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:26,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-27 03:59:26,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:26,865 INFO L124 PetriNetUnfolderBase]: 1158/1757 cut-off events. [2023-08-27 03:59:26,865 INFO L125 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2023-08-27 03:59:26,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5131 conditions, 1757 events. 1158/1757 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7652 event pairs, 276 based on Foata normal form. 44/1754 useless extension candidates. Maximal degree in co-relation 5118. Up to 660 conditions per place. [2023-08-27 03:59:26,873 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 64 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2023-08-27 03:59:26,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 434 flow [2023-08-27 03:59:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:59:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:59:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2023-08-27 03:59:26,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49966329966329964 [2023-08-27 03:59:26,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2023-08-27 03:59:26,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2023-08-27 03:59:26,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:26,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2023-08-27 03:59:26,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,885 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 172 flow. Second operand 5 states and 742 transitions. [2023-08-27 03:59:26,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 434 flow [2023-08-27 03:59:26,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 416 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 03:59:26,889 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 230 flow [2023-08-27 03:59:26,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-27 03:59:26,890 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-27 03:59:26,890 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 230 flow [2023-08-27 03:59:26,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:26,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:26,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:59:26,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:26,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash 237244393, now seen corresponding path program 1 times [2023-08-27 03:59:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:26,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029240716] [2023-08-27 03:59:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:27,013 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:59:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029240716] [2023-08-27 03:59:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029240716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:59:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677009517] [2023-08-27 03:59:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:27,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:59:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:59:27,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:59:27,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 297 [2023-08-27 03:59:27,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:27,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 297 [2023-08-27 03:59:27,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:27,301 INFO L124 PetriNetUnfolderBase]: 1079/1595 cut-off events. [2023-08-27 03:59:27,302 INFO L125 PetriNetUnfolderBase]: For 1364/1364 co-relation queries the response was YES. [2023-08-27 03:59:27,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4825 conditions, 1595 events. 1079/1595 cut-off events. For 1364/1364 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6801 event pairs, 251 based on Foata normal form. 11/1602 useless extension candidates. Maximal degree in co-relation 4811. Up to 660 conditions per place. [2023-08-27 03:59:27,310 INFO L140 encePairwiseOnDemand]: 287/297 looper letters, 51 selfloop transitions, 17 changer transitions 6/77 dead transitions. [2023-08-27 03:59:27,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 432 flow [2023-08-27 03:59:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:59:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:59:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2023-08-27 03:59:27,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887766554433221 [2023-08-27 03:59:27,313 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2023-08-27 03:59:27,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2023-08-27 03:59:27,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:27,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2023-08-27 03:59:27,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,319 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 230 flow. Second operand 6 states and 871 transitions. [2023-08-27 03:59:27,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 432 flow [2023-08-27 03:59:27,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 398 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-27 03:59:27,340 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 204 flow [2023-08-27 03:59:27,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-27 03:59:27,343 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-27 03:59:27,346 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 204 flow [2023-08-27 03:59:27,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:27,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:27,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:59:27,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:27,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:27,347 INFO L85 PathProgramCache]: Analyzing trace with hash -668705928, now seen corresponding path program 1 times [2023-08-27 03:59:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183455640] [2023-08-27 03:59:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:27,655 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:59:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183455640] [2023-08-27 03:59:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183455640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:59:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365303865] [2023-08-27 03:59:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:27,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:59:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:27,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:59:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:59:27,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 297 [2023-08-27 03:59:27,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:27,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 297 [2023-08-27 03:59:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:27,904 INFO L124 PetriNetUnfolderBase]: 983/1601 cut-off events. [2023-08-27 03:59:27,904 INFO L125 PetriNetUnfolderBase]: For 1984/1984 co-relation queries the response was YES. [2023-08-27 03:59:27,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 1601 events. 983/1601 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8328 event pairs, 315 based on Foata normal form. 1/1596 useless extension candidates. Maximal degree in co-relation 5066. Up to 572 conditions per place. [2023-08-27 03:59:27,910 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 66 selfloop transitions, 3 changer transitions 16/87 dead transitions. [2023-08-27 03:59:27,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 652 flow [2023-08-27 03:59:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:59:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:59:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-08-27 03:59:27,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754208754208754 [2023-08-27 03:59:27,913 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-08-27 03:59:27,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-08-27 03:59:27,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:27,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-08-27 03:59:27,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,918 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 204 flow. Second operand 5 states and 706 transitions. [2023-08-27 03:59:27,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 652 flow [2023-08-27 03:59:27,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 87 transitions, 539 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-27 03:59:27,929 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 166 flow [2023-08-27 03:59:27,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-27 03:59:27,929 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-27 03:59:27,930 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 166 flow [2023-08-27 03:59:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:27,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:27,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:59:27,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:27,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1288066656, now seen corresponding path program 2 times [2023-08-27 03:59:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597531658] [2023-08-27 03:59:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:28,214 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:59:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597531658] [2023-08-27 03:59:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597531658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:59:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848041311] [2023-08-27 03:59:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:28,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:59:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:28,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:59:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:59:28,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 297 [2023-08-27 03:59:28,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:28,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 297 [2023-08-27 03:59:28,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:28,407 INFO L124 PetriNetUnfolderBase]: 609/1008 cut-off events. [2023-08-27 03:59:28,407 INFO L125 PetriNetUnfolderBase]: For 962/963 co-relation queries the response was YES. [2023-08-27 03:59:28,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3245 conditions, 1008 events. 609/1008 cut-off events. For 962/963 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4661 event pairs, 235 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3233. Up to 419 conditions per place. [2023-08-27 03:59:28,411 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 45 selfloop transitions, 3 changer transitions 26/76 dead transitions. [2023-08-27 03:59:28,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 505 flow [2023-08-27 03:59:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:59:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:59:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2023-08-27 03:59:28,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468013468013468 [2023-08-27 03:59:28,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2023-08-27 03:59:28,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2023-08-27 03:59:28,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:28,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2023-08-27 03:59:28,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,419 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 166 flow. Second operand 5 states and 695 transitions. [2023-08-27 03:59:28,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 505 flow [2023-08-27 03:59:28,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 489 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 03:59:28,425 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 168 flow [2023-08-27 03:59:28,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-27 03:59:28,426 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-27 03:59:28,426 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 168 flow [2023-08-27 03:59:28,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:28,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:59:28,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:28,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2001206740, now seen corresponding path program 3 times [2023-08-27 03:59:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:28,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129498826] [2023-08-27 03:59:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:59:28,726 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:59:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:59:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129498826] [2023-08-27 03:59:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129498826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:59:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:59:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:59:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891938412] [2023-08-27 03:59:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:59:28,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:59:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:59:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:59:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:59:28,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 297 [2023-08-27 03:59:28,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:59:28,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 297 [2023-08-27 03:59:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:59:28,869 INFO L124 PetriNetUnfolderBase]: 309/527 cut-off events. [2023-08-27 03:59:28,869 INFO L125 PetriNetUnfolderBase]: For 504/507 co-relation queries the response was YES. [2023-08-27 03:59:28,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 527 events. 309/527 cut-off events. For 504/507 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1905 event pairs, 104 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 1660. Up to 218 conditions per place. [2023-08-27 03:59:28,871 INFO L140 encePairwiseOnDemand]: 292/297 looper letters, 48 selfloop transitions, 3 changer transitions 20/73 dead transitions. [2023-08-27 03:59:28,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 489 flow [2023-08-27 03:59:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:59:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:59:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-27 03:59:28,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465993265993266 [2023-08-27 03:59:28,874 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-27 03:59:28,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-27 03:59:28,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:59:28,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-27 03:59:28,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 297.0) internal successors, (1782), 6 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,879 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 168 flow. Second operand 5 states and 692 transitions. [2023-08-27 03:59:28,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 489 flow [2023-08-27 03:59:28,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 473 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-27 03:59:28,883 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 166 flow [2023-08-27 03:59:28,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=297, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-08-27 03:59:28,883 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-27 03:59:28,884 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 166 flow [2023-08-27 03:59:28,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:59:28,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:59:28,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:28,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:59:28,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:59:28,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:59:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash 588028850, now seen corresponding path program 4 times [2023-08-27 03:59:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:59:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949629485] [2023-08-27 03:59:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:59:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:59:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:59:29,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:59:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:59:29,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:59:29,164 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:59:29,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:59:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 03:59:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:59:29,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (17 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:59:29,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:59:29,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 23 remaining) [2023-08-27 03:59:29,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:59:29,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:59:29,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:59:29,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:59:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:59:29,169 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-27 03:59:29,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:59:29,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:59:29,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:59:29 BasicIcfg [2023-08-27 03:59:29,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:59:29,310 INFO L158 Benchmark]: Toolchain (without parser) took 17960.42ms. Allocated memory was 392.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 367.6MB in the beginning and 1.0GB in the end (delta: -669.7MB). Peak memory consumption was 607.8MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,310 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 392.2MB. Free memory was 368.5MB in the beginning and 368.3MB in the end (delta: 187.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:59:29,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.66ms. Allocated memory is still 392.2MB. Free memory was 367.3MB in the beginning and 342.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.45ms. Allocated memory is still 392.2MB. Free memory was 342.9MB in the beginning and 340.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,311 INFO L158 Benchmark]: Boogie Preprocessor took 64.26ms. Allocated memory is still 392.2MB. Free memory was 340.0MB in the beginning and 337.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,311 INFO L158 Benchmark]: RCFGBuilder took 883.94ms. Allocated memory is still 392.2MB. Free memory was 337.5MB in the beginning and 310.2MB in the end (delta: 27.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,311 INFO L158 Benchmark]: TraceAbstraction took 16466.64ms. Allocated memory was 392.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 309.1MB in the beginning and 1.0GB in the end (delta: -728.3MB). Peak memory consumption was 547.9MB. Max. memory is 16.0GB. [2023-08-27 03:59:29,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 392.2MB. Free memory was 368.5MB in the beginning and 368.3MB in the end (delta: 187.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 465.66ms. Allocated memory is still 392.2MB. Free memory was 367.3MB in the beginning and 342.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.45ms. Allocated memory is still 392.2MB. Free memory was 342.9MB in the beginning and 340.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 64.26ms. Allocated memory is still 392.2MB. Free memory was 340.0MB in the beginning and 337.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 883.94ms. Allocated memory is still 392.2MB. Free memory was 337.5MB in the beginning and 310.2MB in the end (delta: 27.4MB). Peak memory consumption was 32.7MB. Max. memory is 16.0GB. * TraceAbstraction took 16466.64ms. Allocated memory was 392.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 309.1MB in the beginning and 1.0GB in the end (delta: -728.3MB). Peak memory consumption was 547.9MB. 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: 7.4s, 167 PlacesBefore, 50 PlacesAfterwards, 157 TransitionsBefore, 38 TransitionsAfterwards, 4066 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 15260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6158, independent: 5805, independent conditional: 0, independent unconditional: 5805, dependent: 353, dependent conditional: 0, dependent unconditional: 353, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2242, independent: 2176, independent conditional: 0, independent unconditional: 2176, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6158, independent: 3629, independent conditional: 0, independent unconditional: 3629, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 2242, unknown conditional: 0, unknown unconditional: 2242] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 248, Positive conditional cache size: 0, Positive unconditional cache size: 248, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-2, t2709={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-1, t2709={9:0}, t2710={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=0, t2709={9:0}, t2710={10:0}, t2711={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=1, t2709={9:0}, t2710={10:0}, t2711={7:0}, t2712={11:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L860] EXPR 4 __unbuffered_cnt + 1 [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L779] EXPR 1 __unbuffered_cnt + 1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L789] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] EXPR 2 __unbuffered_cnt + 1 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L824] EXPR 3 __unbuffered_cnt + 1 [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={9:0}, t2710={10:0}, t2711={7:0}, t2712={11:0}, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] 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", "thin002_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={265:266}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 794]: 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: 824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 882]: 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: 878]: 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: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 202 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 7 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, InterpolantAutomatonStates: 40, 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, 1.3s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:59:29,337 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...