/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:16:07,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:16:07,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:16:07,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:16:07,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:16:07,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:16:07,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:16:07,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:16:07,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:16:07,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:16:07,785 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:16:07,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:16:07,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:16:07,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:16:07,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:16:07,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:16:07,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:16:07,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:16:07,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:16:07,789 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:16:07,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:16:07,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:16:07,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:16:07,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:16:07,791 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:16:08,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:16:08,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:16:08,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:16:08,048 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:16:08,053 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:16:08,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:16:09,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:16:09,304 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:16:09,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:16:09,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd39b7109/97b2d500159543d7ac013869af129265/FLAGb0b13ac41 [2023-08-26 21:16:09,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd39b7109/97b2d500159543d7ac013869af129265 [2023-08-26 21:16:09,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:16:09,326 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:16:09,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:16:09,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:16:09,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:16:09,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd01a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09, skipping insertion in model container [2023-08-26 21:16:09,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,380 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:16:09,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:16:09,702 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:16:09,728 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:16:09,730 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:16:09,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:16:09,793 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:16:09,793 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:16:09,798 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:16:09,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09 WrapperNode [2023-08-26 21:16:09,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:16:09,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:16:09,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:16:09,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:16:09,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,866 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-08-26 21:16:09,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:16:09,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:16:09,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:16:09,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:16:09,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:16:09,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:16:09,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:16:09,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:16:09,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (1/1) ... [2023-08-26 21:16:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:16:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:16:09,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:16:09,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:16:09,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:16:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:16:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:16:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:16:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:16:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:16:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:16:09,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:16:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:16:09,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:16:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:16:09,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:16:09,995 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:16:10,132 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:16:10,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:16:10,383 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:16:10,507 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:16:10,508 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:16:10,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:16:10 BoogieIcfgContainer [2023-08-26 21:16:10,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:16:10,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:16:10,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:16:10,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:16:10,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:16:09" (1/3) ... [2023-08-26 21:16:10,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58637b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:16:10, skipping insertion in model container [2023-08-26 21:16:10,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:16:09" (2/3) ... [2023-08-26 21:16:10,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58637b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:16:10, skipping insertion in model container [2023-08-26 21:16:10,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:16:10" (3/3) ... [2023-08-26 21:16:10,517 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-08-26 21:16:10,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:16:10,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 21:16:10,528 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:16:10,586 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:16:10,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 21:16:10,696 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 21:16:10,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:16:10,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 21:16:10,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 21:16:10,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 21:16:10,707 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:16:10,712 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 21:16:10,730 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 21:16:10,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 21:16:10,773 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 21:16:10,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:16:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-26 21:16:10,776 INFO L119 LiptonReduction]: Number of co-enabled transitions 4342 [2023-08-26 21:16:14,010 INFO L134 LiptonReduction]: Checked pairs total: 16809 [2023-08-26 21:16:14,010 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 21:16:14,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:16:14,022 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;@e1113ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:16:14,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-26 21:16:14,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:16:14,025 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-26 21:16:14,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:16:14,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:14,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:16:14,026 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-26 21:16:14,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:14,029 INFO L85 PathProgramCache]: Analyzing trace with hash 584288339, now seen corresponding path program 1 times [2023-08-26 21:16:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240773718] [2023-08-26 21:16:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240773718] [2023-08-26 21:16:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240773718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:16:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146525216] [2023-08-26 21:16:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:16:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:14,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:16:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:16:14,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:14,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:14,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:14,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:14,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:15,639 INFO L124 PetriNetUnfolderBase]: 12877/17968 cut-off events. [2023-08-26 21:16:15,639 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-08-26 21:16:15,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36150 conditions, 17968 events. 12877/17968 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 109344 event pairs, 5743 based on Foata normal form. 732/11465 useless extension candidates. Maximal degree in co-relation 36138. Up to 17291 conditions per place. [2023-08-26 21:16:15,726 INFO L140 encePairwiseOnDemand]: 242/257 looper letters, 48 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-08-26 21:16:15,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 243 flow [2023-08-26 21:16:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:16:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:16:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:16:15,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188067444876784 [2023-08-26 21:16:15,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:16:15,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:16:15,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:15,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:16:15,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 21:16:15,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:15,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:15,743 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:16:15,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 243 flow [2023-08-26 21:16:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:16:15,748 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 135 flow [2023-08-26 21:16:15,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-26 21:16:15,752 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-26 21:16:15,752 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 135 flow [2023-08-26 21:16:15,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:15,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:15,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:16:15,753 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-26 21:16:15,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1090206801, now seen corresponding path program 1 times [2023-08-26 21:16:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35122349] [2023-08-26 21:16:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:15,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35122349] [2023-08-26 21:16:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35122349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:16:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464669862] [2023-08-26 21:16:15,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:16:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:16:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:16:15,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 257 [2023-08-26 21:16:15,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:15,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:15,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 257 [2023-08-26 21:16:15,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:16,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L806-->P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_43)) (< 2147483646 v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[][45], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 24#P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 124#L864true, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:16,963 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,963 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,964 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,964 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] L806-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (<= v_~__unbuffered_cnt~0_86 2147483646) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_86))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base][46], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 124#L864true, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 77#P2EXITtrue, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:16,965 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,965 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,965 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:16,965 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-26 21:16:17,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L806-->P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_43)) (< 2147483646 v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[][45], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 24#P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 109#L18true, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,006 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,006 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,006 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,006 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] L806-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (<= v_~__unbuffered_cnt~0_86 2147483646) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_86))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base][46], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 77#P2EXITtrue, P3Thread1of1ForFork2InUse, 109#L18true, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,007 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-26 21:16:17,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L806-->P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_43)) (< 2147483646 v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[][45], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 24#P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 104#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,032 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,034 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,034 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] L806-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (<= v_~__unbuffered_cnt~0_86 2147483646) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_86))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base][46], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 77#P2EXITtrue, 104#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,035 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([452] L806-->P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_43)) (< 2147483646 v_~__unbuffered_cnt~0_43)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[][45], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 24#P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 3#ULTIMATE.startEXITtrue, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,035 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,035 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([537] L806-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (<= v_~__unbuffered_cnt~0_86 2147483646) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (<= 0 (+ 2147483649 v_~__unbuffered_cnt~0_86))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base][46], [130#P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, P0Thread1of1ForFork1InUse, 154#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 77#P2EXITtrue, 3#ULTIMATE.startEXITtrue, P3Thread1of1ForFork2InUse, 129#P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 159#true, 118#P1EXITtrue, Black: 156#(= ~__unbuffered_cnt~0 0)]) [2023-08-26 21:16:17,036 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,036 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,036 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,036 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-26 21:16:17,052 INFO L124 PetriNetUnfolderBase]: 9323/14082 cut-off events. [2023-08-26 21:16:17,052 INFO L125 PetriNetUnfolderBase]: For 1751/2130 co-relation queries the response was YES. [2023-08-26 21:16:17,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33906 conditions, 14082 events. 9323/14082 cut-off events. For 1751/2130 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 100261 event pairs, 2266 based on Foata normal form. 0/10618 useless extension candidates. Maximal degree in co-relation 33895. Up to 10450 conditions per place. [2023-08-26 21:16:17,178 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 53 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-26 21:16:17,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 312 flow [2023-08-26 21:16:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:16:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:16:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-26 21:16:17,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188067444876784 [2023-08-26 21:16:17,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-26 21:16:17,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-26 21:16:17,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:17,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-26 21:16:17,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 21:16:17,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,184 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 135 flow. Second operand 3 states and 400 transitions. [2023-08-26 21:16:17,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 312 flow [2023-08-26 21:16:17,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:17,186 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 132 flow [2023-08-26 21:16:17,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-26 21:16:17,187 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-26 21:16:17,187 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 132 flow [2023-08-26 21:16:17,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:17,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:17,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:16:17,188 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-26 21:16:17,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1873290386, now seen corresponding path program 1 times [2023-08-26 21:16:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:17,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468977712] [2023-08-26 21:16:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468977712] [2023-08-26 21:16:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468977712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:16:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166672702] [2023-08-26 21:16:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:17,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:17,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:17,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:17,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:17,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:17,963 INFO L124 PetriNetUnfolderBase]: 6052/8545 cut-off events. [2023-08-26 21:16:17,963 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2023-08-26 21:16:17,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21316 conditions, 8545 events. 6052/8545 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 47928 event pairs, 2197 based on Foata normal form. 0/6608 useless extension candidates. Maximal degree in co-relation 21304. Up to 8031 conditions per place. [2023-08-26 21:16:17,989 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 42 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-26 21:16:17,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 246 flow [2023-08-26 21:16:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-08-26 21:16:17,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48540856031128404 [2023-08-26 21:16:17,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-08-26 21:16:17,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-08-26 21:16:17,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:17,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-08-26 21:16:17,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,994 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,994 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 132 flow. Second operand 4 states and 499 transitions. [2023-08-26 21:16:17,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 246 flow [2023-08-26 21:16:17,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:17,996 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 122 flow [2023-08-26 21:16:17,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-26 21:16:17,997 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2023-08-26 21:16:17,997 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 122 flow [2023-08-26 21:16:17,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:17,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:17,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:17,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:16:18,001 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-26 21:16:18,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash -422046993, now seen corresponding path program 1 times [2023-08-26 21:16:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116936162] [2023-08-26 21:16:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:18,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:18,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116936162] [2023-08-26 21:16:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116936162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:16:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857749095] [2023-08-26 21:16:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:18,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:18,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:18,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:18,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:18,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:18,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:18,311 INFO L124 PetriNetUnfolderBase]: 2217/3368 cut-off events. [2023-08-26 21:16:18,311 INFO L125 PetriNetUnfolderBase]: For 764/764 co-relation queries the response was YES. [2023-08-26 21:16:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8274 conditions, 3368 events. 2217/3368 cut-off events. For 764/764 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17668 event pairs, 651 based on Foata normal form. 81/2954 useless extension candidates. Maximal degree in co-relation 8262. Up to 2146 conditions per place. [2023-08-26 21:16:18,323 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 54 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2023-08-26 21:16:18,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 326 flow [2023-08-26 21:16:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:16:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:16:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 21:16:18,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5019455252918288 [2023-08-26 21:16:18,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 21:16:18,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 21:16:18,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:18,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 21:16:18,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,335 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 122 flow. Second operand 4 states and 516 transitions. [2023-08-26 21:16:18,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 326 flow [2023-08-26 21:16:18,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:18,338 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 176 flow [2023-08-26 21:16:18,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 21:16:18,339 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-26 21:16:18,339 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 176 flow [2023-08-26 21:16:18,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:18,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:18,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:16:18,340 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-26 21:16:18,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1444118633, now seen corresponding path program 1 times [2023-08-26 21:16:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329613965] [2023-08-26 21:16:18,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:18,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:18,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329613965] [2023-08-26 21:16:18,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329613965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:18,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:18,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:18,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745675619] [2023-08-26 21:16:18,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:18,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:18,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:18,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:18,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:18,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:18,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:18,613 INFO L124 PetriNetUnfolderBase]: 1254/1901 cut-off events. [2023-08-26 21:16:18,613 INFO L125 PetriNetUnfolderBase]: For 1260/1260 co-relation queries the response was YES. [2023-08-26 21:16:18,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 1901 events. 1254/1901 cut-off events. For 1260/1260 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8836 event pairs, 324 based on Foata normal form. 45/1856 useless extension candidates. Maximal degree in co-relation 5460. Up to 715 conditions per place. [2023-08-26 21:16:18,619 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 64 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2023-08-26 21:16:18,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 438 flow [2023-08-26 21:16:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-26 21:16:18,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49961089494163424 [2023-08-26 21:16:18,621 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-26 21:16:18,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-26 21:16:18,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:18,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-26 21:16:18,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,625 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,625 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 176 flow. Second operand 5 states and 642 transitions. [2023-08-26 21:16:18,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 438 flow [2023-08-26 21:16:18,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 420 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 21:16:18,630 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 234 flow [2023-08-26 21:16:18,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-26 21:16:18,632 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-26 21:16:18,632 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 234 flow [2023-08-26 21:16:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:18,632 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] [2023-08-26 21:16:18,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:16:18,632 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:18,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2095224276, now seen corresponding path program 1 times [2023-08-26 21:16:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721466021] [2023-08-26 21:16:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721466021] [2023-08-26 21:16:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721466021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:16:18,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308098776] [2023-08-26 21:16:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:16:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:16:18,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:16:18,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:18,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:18,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:18,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:18,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:19,155 INFO L124 PetriNetUnfolderBase]: 2645/3985 cut-off events. [2023-08-26 21:16:19,155 INFO L125 PetriNetUnfolderBase]: For 4485/4485 co-relation queries the response was YES. [2023-08-26 21:16:19,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11644 conditions, 3985 events. 2645/3985 cut-off events. For 4485/4485 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21185 event pairs, 1121 based on Foata normal form. 0/3897 useless extension candidates. Maximal degree in co-relation 11630. Up to 2157 conditions per place. [2023-08-26 21:16:19,192 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 93 selfloop transitions, 7 changer transitions 11/114 dead transitions. [2023-08-26 21:16:19,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 114 transitions, 820 flow [2023-08-26 21:16:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-26 21:16:19,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050583657587548 [2023-08-26 21:16:19,195 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-26 21:16:19,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-26 21:16:19,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:19,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-26 21:16:19,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,198 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 234 flow. Second operand 5 states and 649 transitions. [2023-08-26 21:16:19,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 114 transitions, 820 flow [2023-08-26 21:16:19,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 114 transitions, 754 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:16:19,211 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 252 flow [2023-08-26 21:16:19,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-08-26 21:16:19,212 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2023-08-26 21:16:19,212 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 252 flow [2023-08-26 21:16:19,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:19,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:19,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:16:19,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:19,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1876626290, now seen corresponding path program 1 times [2023-08-26 21:16:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628344069] [2023-08-26 21:16:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:19,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:19,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628344069] [2023-08-26 21:16:19,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628344069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:19,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:19,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440832623] [2023-08-26 21:16:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:19,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:16:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:16:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:16:19,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:19,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:19,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:19,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:19,490 INFO L124 PetriNetUnfolderBase]: 1685/2511 cut-off events. [2023-08-26 21:16:19,490 INFO L125 PetriNetUnfolderBase]: For 1483/1483 co-relation queries the response was YES. [2023-08-26 21:16:19,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7059 conditions, 2511 events. 1685/2511 cut-off events. For 1483/1483 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12559 event pairs, 391 based on Foata normal form. 20/2486 useless extension candidates. Maximal degree in co-relation 7043. Up to 1001 conditions per place. [2023-08-26 21:16:19,496 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 50 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-26 21:16:19,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 466 flow [2023-08-26 21:16:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:16:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:16:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-26 21:16:19,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48702983138780803 [2023-08-26 21:16:19,498 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-26 21:16:19,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-26 21:16:19,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:19,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-26 21:16:19,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,501 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,501 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 252 flow. Second operand 6 states and 751 transitions. [2023-08-26 21:16:19,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 466 flow [2023-08-26 21:16:19,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 461 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 21:16:19,520 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 220 flow [2023-08-26 21:16:19,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2023-08-26 21:16:19,521 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-26 21:16:19,521 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 220 flow [2023-08-26 21:16:19,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:19,521 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, 1, 1] [2023-08-26 21:16:19,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:16:19,522 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-26 21:16:19,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:19,522 INFO L85 PathProgramCache]: Analyzing trace with hash -930214503, now seen corresponding path program 1 times [2023-08-26 21:16:19,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:19,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379823937] [2023-08-26 21:16:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379823937] [2023-08-26 21:16:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379823937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:19,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:19,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:16:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545081813] [2023-08-26 21:16:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:19,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:16:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:16:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:16:19,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-08-26 21:16:19,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:19,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-08-26 21:16:19,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:19,825 INFO L124 PetriNetUnfolderBase]: 717/1227 cut-off events. [2023-08-26 21:16:19,825 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2023-08-26 21:16:19,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 1227 events. 717/1227 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6173 event pairs, 118 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 3892. Up to 664 conditions per place. [2023-08-26 21:16:19,828 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 48 selfloop transitions, 1 changer transitions 32/85 dead transitions. [2023-08-26 21:16:19,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 85 transitions, 654 flow [2023-08-26 21:16:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:16:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:16:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-26 21:16:19,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762645914396887 [2023-08-26 21:16:19,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-26 21:16:19,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-26 21:16:19,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:19,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-26 21:16:19,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,835 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 220 flow. Second operand 5 states and 612 transitions. [2023-08-26 21:16:19,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 85 transitions, 654 flow [2023-08-26 21:16:19,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 526 flow, removed 27 selfloop flow, removed 8 redundant places. [2023-08-26 21:16:19,841 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 169 flow [2023-08-26 21:16:19,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-26 21:16:19,841 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-26 21:16:19,841 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 169 flow [2023-08-26 21:16:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:19,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:19,842 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, 1, 1] [2023-08-26 21:16:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:16:19,842 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-26 21:16:19,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 414284573, now seen corresponding path program 2 times [2023-08-26 21:16:19,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:19,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295680409] [2023-08-26 21:16:19,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295680409] [2023-08-26 21:16:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295680409] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:16:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601125253] [2023-08-26 21:16:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:20,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:16:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:16:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:16:20,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 257 [2023-08-26 21:16:20,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:20,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:20,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 257 [2023-08-26 21:16:20,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:21,461 INFO L124 PetriNetUnfolderBase]: 2285/3447 cut-off events. [2023-08-26 21:16:21,461 INFO L125 PetriNetUnfolderBase]: For 2616/2616 co-relation queries the response was YES. [2023-08-26 21:16:21,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 3447 events. 2285/3447 cut-off events. For 2616/2616 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16158 event pairs, 298 based on Foata normal form. 1/3448 useless extension candidates. Maximal degree in co-relation 10104. Up to 1536 conditions per place. [2023-08-26 21:16:21,469 INFO L140 encePairwiseOnDemand]: 246/257 looper letters, 49 selfloop transitions, 6 changer transitions 106/161 dead transitions. [2023-08-26 21:16:21,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 161 transitions, 972 flow [2023-08-26 21:16:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 21:16:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 21:16:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1084 transitions. [2023-08-26 21:16:21,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217898832684825 [2023-08-26 21:16:21,472 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1084 transitions. [2023-08-26 21:16:21,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1084 transitions. [2023-08-26 21:16:21,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:21,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1084 transitions. [2023-08-26 21:16:21,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.4) internal successors, (1084), 10 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:21,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:21,477 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 257.0) internal successors, (2827), 11 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:21,477 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 169 flow. Second operand 10 states and 1084 transitions. [2023-08-26 21:16:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 161 transitions, 972 flow [2023-08-26 21:16:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 161 transitions, 960 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 21:16:21,496 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 229 flow [2023-08-26 21:16:21,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=229, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-08-26 21:16:21,497 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-26 21:16:21,497 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 229 flow [2023-08-26 21:16:21,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:21,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:21,498 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, 1, 1] [2023-08-26 21:16:21,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:16:21,498 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-26 21:16:21,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1853065861, now seen corresponding path program 3 times [2023-08-26 21:16:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246172926] [2023-08-26 21:16:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:16:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:16:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:16:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246172926] [2023-08-26 21:16:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246172926] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:16:22,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:16:22,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:16:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166042176] [2023-08-26 21:16:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:16:22,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:16:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:16:22,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:16:22,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:16:22,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 257 [2023-08-26 21:16:22,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 229 flow. Second operand has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:22,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:16:22,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 257 [2023-08-26 21:16:22,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:16:22,801 INFO L124 PetriNetUnfolderBase]: 806/1364 cut-off events. [2023-08-26 21:16:22,801 INFO L125 PetriNetUnfolderBase]: For 3750/3766 co-relation queries the response was YES. [2023-08-26 21:16:22,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 1364 events. 806/1364 cut-off events. For 3750/3766 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6330 event pairs, 110 based on Foata normal form. 5/1346 useless extension candidates. Maximal degree in co-relation 5713. Up to 661 conditions per place. [2023-08-26 21:16:22,805 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 54 selfloop transitions, 6 changer transitions 9/73 dead transitions. [2023-08-26 21:16:22,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 539 flow [2023-08-26 21:16:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:16:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:16:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-08-26 21:16:22,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.437094682230869 [2023-08-26 21:16:22,807 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-08-26 21:16:22,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-08-26 21:16:22,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:16:22,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-08-26 21:16:22,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:22,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:22,810 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:22,810 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 229 flow. Second operand 6 states and 674 transitions. [2023-08-26 21:16:22,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 539 flow [2023-08-26 21:16:22,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 507 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 21:16:22,819 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 256 flow [2023-08-26 21:16:22,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2023-08-26 21:16:22,820 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-26 21:16:22,820 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 256 flow [2023-08-26 21:16:22,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.66666666666667) internal successors, (969), 9 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:16:22,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:16:22,821 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, 1, 1] [2023-08-26 21:16:22,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:16:22,821 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-26 21:16:22,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:16:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash 282164653, now seen corresponding path program 4 times [2023-08-26 21:16:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:16:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757684212] [2023-08-26 21:16:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:16:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:16:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:16:22,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:16:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:16:22,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:16:22,913 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:16:22,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (17 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-26 21:16:22,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (4 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-26 21:16:22,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-26 21:16:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:16:22,917 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:16:22,921 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:16:22,921 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:16:22,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:16:22 BasicIcfg [2023-08-26 21:16:22,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:16:22,989 INFO L158 Benchmark]: Toolchain (without parser) took 13663.73ms. Allocated memory was 367.0MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 341.6MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-26 21:16:22,989 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:16:22,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.95ms. Allocated memory is still 367.0MB. Free memory was 341.6MB in the beginning and 317.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:16:22,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.82ms. Allocated memory is still 367.0MB. Free memory was 317.6MB in the beginning and 315.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:16:22,990 INFO L158 Benchmark]: Boogie Preprocessor took 43.36ms. Allocated memory is still 367.0MB. Free memory was 315.2MB in the beginning and 313.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:16:22,990 INFO L158 Benchmark]: RCFGBuilder took 598.77ms. Allocated memory is still 367.0MB. Free memory was 313.1MB in the beginning and 271.6MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-26 21:16:22,990 INFO L158 Benchmark]: TraceAbstraction took 12476.60ms. Allocated memory was 367.0MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 270.3MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-26 21:16:22,991 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.10ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 472.95ms. Allocated memory is still 367.0MB. Free memory was 341.6MB in the beginning and 317.6MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.82ms. Allocated memory is still 367.0MB. Free memory was 317.6MB in the beginning and 315.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.36ms. Allocated memory is still 367.0MB. Free memory was 315.2MB in the beginning and 313.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 598.77ms. Allocated memory is still 367.0MB. Free memory was 313.1MB in the beginning and 271.6MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 12476.60ms. Allocated memory was 367.0MB in the beginning and 2.8GB in the end (delta: 2.4GB). Free memory was 270.3MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 147 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 4342 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 16809 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5306, independent: 4940, independent conditional: 0, independent unconditional: 4940, dependent: 366, dependent conditional: 0, dependent unconditional: 366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2274, independent: 2216, independent conditional: 0, independent unconditional: 2216, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5306, independent: 2724, independent conditional: 0, independent unconditional: 2724, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 2274, unknown conditional: 0, unknown unconditional: 2274] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 224, Positive conditional cache size: 0, Positive unconditional cache size: 224, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L758] EXPR 1 __unbuffered_cnt + 1 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] EXPR 3 __unbuffered_cnt + 1 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] EXPR 2 __unbuffered_cnt + 1 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L831] EXPR 4 __unbuffered_cnt + 1 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] 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", "mix029_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 758]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 778]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 849]: 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: 851]: 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: 853]: 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, 184 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: 12.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 26 mSDtfsCounter, 1173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=10, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:16:23,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...