/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:45:45,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:45:45,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:45:45,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:45:45,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:45:45,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:45:45,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:45:45,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:45:45,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:45:45,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:45:45,875 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:45:45,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:45:45,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:45:45,876 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:45:45,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:45:45,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:45:45,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:45:45,878 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:45:45,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:45:45,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:45:45,879 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:45:45,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:45:45,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:45,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:45:45,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:45:45,880 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:45:46,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:45:46,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:45:46,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:45:46,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:45:46,103 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:45:46,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-27 03:45:47,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:45:47,319 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:45:47,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2023-08-27 03:45:47,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d559c146/a7470ed40cbf4dd4942115da2548a217/FLAG1aefc0bc6 [2023-08-27 03:45:47,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d559c146/a7470ed40cbf4dd4942115da2548a217 [2023-08-27 03:45:47,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:45:47,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:45:47,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:47,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:45:47,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:45:47,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7715d2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47, skipping insertion in model container [2023-08-27 03:45:47,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,404 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:45:47,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:47,692 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:45:47,712 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:47,713 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:47,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:47,754 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:47,754 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:47,759 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:45:47,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47 WrapperNode [2023-08-27 03:45:47,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:47,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:47,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:45:47,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:45:47,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,789 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2023-08-27 03:45:47,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:47,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:45:47,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:45:47,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:45:47,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:45:47,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:45:47,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:45:47,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:45:47,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (1/1) ... [2023-08-27 03:45:47,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:45:47,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:45:47,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:45:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:45:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:45:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:45:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:45:47,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:45:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:45:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:45:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:45:47,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:45:47,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:45:47,867 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:45:47,964 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:45:47,965 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:45:48,180 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:45:48,265 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:45:48,266 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:45:48,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:48 BoogieIcfgContainer [2023-08-27 03:45:48,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:45:48,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:45:48,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:45:48,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:45:48,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:45:47" (1/3) ... [2023-08-27 03:45:48,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea0b5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:48, skipping insertion in model container [2023-08-27 03:45:48,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:47" (2/3) ... [2023-08-27 03:45:48,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea0b5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:48, skipping insertion in model container [2023-08-27 03:45:48,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:48" (3/3) ... [2023-08-27 03:45:48,272 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2023-08-27 03:45:48,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:45:48,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:45:48,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:45:48,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:45:48,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 257 flow [2023-08-27 03:45:48,425 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-27 03:45:48,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:48,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:45:48,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 121 transitions, 257 flow [2023-08-27 03:45:48,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 118 transitions, 245 flow [2023-08-27 03:45:48,436 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:45:48,447 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-27 03:45:48,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 245 flow [2023-08-27 03:45:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 245 flow [2023-08-27 03:45:48,470 INFO L124 PetriNetUnfolderBase]: 3/118 cut-off events. [2023-08-27 03:45:48,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:45:48,473 INFO L119 LiptonReduction]: Number of co-enabled transitions 2696 [2023-08-27 03:45:51,421 INFO L134 LiptonReduction]: Checked pairs total: 9158 [2023-08-27 03:45:51,421 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-27 03:45:51,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:45:51,434 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;@339a5235, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:45:51,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:45:51,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:45:51,436 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:45:51,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:51,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:51,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:45:51,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:51,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 507380440, now seen corresponding path program 1 times [2023-08-27 03:45:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:51,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112713446] [2023-08-27 03:45:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112713446] [2023-08-27 03:45:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112713446] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:51,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:51,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018659944] [2023-08-27 03:45:51,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:51,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:51,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-27 03:45:51,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:51,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:51,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-27 03:45:51,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:51,908 INFO L124 PetriNetUnfolderBase]: 1371/2183 cut-off events. [2023-08-27 03:45:51,908 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-27 03:45:51,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4398 conditions, 2183 events. 1371/2183 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11480 event pairs, 583 based on Foata normal form. 130/1532 useless extension candidates. Maximal degree in co-relation 4387. Up to 1989 conditions per place. [2023-08-27 03:45:51,920 INFO L140 encePairwiseOnDemand]: 214/226 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 03:45:51,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 191 flow [2023-08-27 03:45:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-27 03:45:51,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103244837758112 [2023-08-27 03:45:51,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-27 03:45:51,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-27 03:45:51,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:51,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-27 03:45:51,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:51,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:51,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:51,938 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 346 transitions. [2023-08-27 03:45:51,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 191 flow [2023-08-27 03:45:51,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:51,941 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 104 flow [2023-08-27 03:45:51,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 03:45:51,944 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 03:45:51,944 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 104 flow [2023-08-27 03:45:51,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:51,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:51,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:51,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:45:51,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:51,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1984723904, now seen corresponding path program 1 times [2023-08-27 03:45:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630844127] [2023-08-27 03:45:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630844127] [2023-08-27 03:45:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630844127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:52,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869444551] [2023-08-27 03:45:52,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:52,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 226 [2023-08-27 03:45:52,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:52,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 226 [2023-08-27 03:45:52,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:52,263 INFO L124 PetriNetUnfolderBase]: 1033/1805 cut-off events. [2023-08-27 03:45:52,264 INFO L125 PetriNetUnfolderBase]: For 209/241 co-relation queries the response was YES. [2023-08-27 03:45:52,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1805 events. 1033/1805 cut-off events. For 209/241 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10549 event pairs, 211 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 4264. Up to 1372 conditions per place. [2023-08-27 03:45:52,273 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 03:45:52,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 232 flow [2023-08-27 03:45:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-27 03:45:52,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073746312684366 [2023-08-27 03:45:52,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-27 03:45:52,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-27 03:45:52,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:52,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-27 03:45:52,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,282 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 104 flow. Second operand 3 states and 344 transitions. [2023-08-27 03:45:52,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 232 flow [2023-08-27 03:45:52,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:52,284 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2023-08-27 03:45:52,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-27 03:45:52,285 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 03:45:52,285 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2023-08-27 03:45:52,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:52,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:52,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:45:52,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:52,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1852920151, now seen corresponding path program 1 times [2023-08-27 03:45:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905214509] [2023-08-27 03:45:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:52,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905214509] [2023-08-27 03:45:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905214509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:52,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942550973] [2023-08-27 03:45:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:52,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:52,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-27 03:45:52,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:52,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-27 03:45:52,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:52,525 INFO L124 PetriNetUnfolderBase]: 845/1361 cut-off events. [2023-08-27 03:45:52,525 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2023-08-27 03:45:52,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 1361 events. 845/1361 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6511 event pairs, 304 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 3317. Up to 1198 conditions per place. [2023-08-27 03:45:52,531 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-27 03:45:52,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 194 flow [2023-08-27 03:45:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-27 03:45:52,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47898230088495575 [2023-08-27 03:45:52,533 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-27 03:45:52,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-27 03:45:52,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:52,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-27 03:45:52,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,535 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 4 states and 433 transitions. [2023-08-27 03:45:52,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 194 flow [2023-08-27 03:45:52,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:52,537 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 94 flow [2023-08-27 03:45:52,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:45:52,538 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 03:45:52,538 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 94 flow [2023-08-27 03:45:52,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:52,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:52,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:45:52,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:52,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash -964946198, now seen corresponding path program 1 times [2023-08-27 03:45:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46925607] [2023-08-27 03:45:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46925607] [2023-08-27 03:45:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46925607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574424375] [2023-08-27 03:45:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:52,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:52,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-27 03:45:52,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:52,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-27 03:45:52,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:52,660 INFO L124 PetriNetUnfolderBase]: 308/543 cut-off events. [2023-08-27 03:45:52,660 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2023-08-27 03:45:52,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 543 events. 308/543 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2115 event pairs, 105 based on Foata normal form. 26/534 useless extension candidates. Maximal degree in co-relation 1322. Up to 205 conditions per place. [2023-08-27 03:45:52,663 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-08-27 03:45:52,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 252 flow [2023-08-27 03:45:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-27 03:45:52,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49336283185840707 [2023-08-27 03:45:52,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-27 03:45:52,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-27 03:45:52,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:52,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-27 03:45:52,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,667 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,667 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 94 flow. Second operand 4 states and 446 transitions. [2023-08-27 03:45:52,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 252 flow [2023-08-27 03:45:52,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:52,668 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 135 flow [2023-08-27 03:45:52,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-27 03:45:52,669 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 03:45:52,669 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 135 flow [2023-08-27 03:45:52,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:52,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:52,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:45:52,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:52,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1917913614, now seen corresponding path program 1 times [2023-08-27 03:45:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:52,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160332861] [2023-08-27 03:45:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:52,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160332861] [2023-08-27 03:45:52,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160332861] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:52,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:52,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:52,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841522097] [2023-08-27 03:45:52,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:52,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:52,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:52,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:52,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:52,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-08-27 03:45:52,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:52,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-08-27 03:45:52,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:52,917 INFO L124 PetriNetUnfolderBase]: 482/799 cut-off events. [2023-08-27 03:45:52,917 INFO L125 PetriNetUnfolderBase]: For 592/592 co-relation queries the response was YES. [2023-08-27 03:45:52,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 799 events. 482/799 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2934 event pairs, 163 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 2172. Up to 496 conditions per place. [2023-08-27 03:45:52,920 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 52 selfloop transitions, 5 changer transitions 3/60 dead transitions. [2023-08-27 03:45:52,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 361 flow [2023-08-27 03:45:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-27 03:45:52,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504424778761062 [2023-08-27 03:45:52,922 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-27 03:45:52,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-27 03:45:52,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:52,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-27 03:45:52,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,925 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 135 flow. Second operand 5 states and 509 transitions. [2023-08-27 03:45:52,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 361 flow [2023-08-27 03:45:52,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 339 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:52,927 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 155 flow [2023-08-27 03:45:52,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-27 03:45:52,927 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:45:52,927 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 155 flow [2023-08-27 03:45:52,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:52,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:52,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:45:52,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:52,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -444314730, now seen corresponding path program 1 times [2023-08-27 03:45:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482623552] [2023-08-27 03:45:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:52,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482623552] [2023-08-27 03:45:52,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482623552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:52,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564498830] [2023-08-27 03:45:52,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:52,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:52,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:52,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 226 [2023-08-27 03:45:52,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:52,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:52,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 226 [2023-08-27 03:45:52,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:53,076 INFO L124 PetriNetUnfolderBase]: 245/414 cut-off events. [2023-08-27 03:45:53,076 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-08-27 03:45:53,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 414 events. 245/414 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1512 event pairs, 85 based on Foata normal form. 9/422 useless extension candidates. Maximal degree in co-relation 1145. Up to 176 conditions per place. [2023-08-27 03:45:53,078 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 33 selfloop transitions, 10 changer transitions 5/50 dead transitions. [2023-08-27 03:45:53,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 273 flow [2023-08-27 03:45:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2023-08-27 03:45:53,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.479646017699115 [2023-08-27 03:45:53,079 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2023-08-27 03:45:53,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2023-08-27 03:45:53,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:53,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2023-08-27 03:45:53,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,082 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 155 flow. Second operand 5 states and 542 transitions. [2023-08-27 03:45:53,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 273 flow [2023-08-27 03:45:53,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 248 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-27 03:45:53,083 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 127 flow [2023-08-27 03:45:53,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-27 03:45:53,084 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-27 03:45:53,084 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 127 flow [2023-08-27 03:45:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:53,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:53,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:45:53,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:53,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -577210870, now seen corresponding path program 1 times [2023-08-27 03:45:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803692328] [2023-08-27 03:45:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803692328] [2023-08-27 03:45:53,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803692328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736844557] [2023-08-27 03:45:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:53,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 226 [2023-08-27 03:45:53,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:53,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 226 [2023-08-27 03:45:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:53,400 INFO L124 PetriNetUnfolderBase]: 233/425 cut-off events. [2023-08-27 03:45:53,400 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2023-08-27 03:45:53,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 425 events. 233/425 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1640 event pairs, 17 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1324. Up to 214 conditions per place. [2023-08-27 03:45:53,402 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 41 selfloop transitions, 4 changer transitions 29/74 dead transitions. [2023-08-27 03:45:53,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 466 flow [2023-08-27 03:45:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 684 transitions. [2023-08-27 03:45:53,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43236409608091025 [2023-08-27 03:45:53,404 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 684 transitions. [2023-08-27 03:45:53,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 684 transitions. [2023-08-27 03:45:53,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:53,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 684 transitions. [2023-08-27 03:45:53,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,407 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,407 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 127 flow. Second operand 7 states and 684 transitions. [2023-08-27 03:45:53,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 466 flow [2023-08-27 03:45:53,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 410 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:53,409 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 133 flow [2023-08-27 03:45:53,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-08-27 03:45:53,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:45:53,410 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 133 flow [2023-08-27 03:45:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:53,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:53,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:45:53,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:53,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -239797026, now seen corresponding path program 2 times [2023-08-27 03:45:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:53,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709585011] [2023-08-27 03:45:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:53,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:53,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709585011] [2023-08-27 03:45:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709585011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:53,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:53,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41105712] [2023-08-27 03:45:53,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:53,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:53,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:53,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-27 03:45:53,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:53,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-27 03:45:53,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:53,689 INFO L124 PetriNetUnfolderBase]: 143/299 cut-off events. [2023-08-27 03:45:53,690 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2023-08-27 03:45:53,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 299 events. 143/299 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1144 event pairs, 31 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 998. Up to 179 conditions per place. [2023-08-27 03:45:53,691 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 27 selfloop transitions, 1 changer transitions 29/58 dead transitions. [2023-08-27 03:45:53,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 379 flow [2023-08-27 03:45:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2023-08-27 03:45:53,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45309734513274336 [2023-08-27 03:45:53,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2023-08-27 03:45:53,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2023-08-27 03:45:53,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:53,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2023-08-27 03:45:53,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,695 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 133 flow. Second operand 5 states and 512 transitions. [2023-08-27 03:45:53,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 379 flow [2023-08-27 03:45:53,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 373 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:53,697 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 127 flow [2023-08-27 03:45:53,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-27 03:45:53,698 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-27 03:45:53,698 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 127 flow [2023-08-27 03:45:53,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:53,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:53,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:53,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:45:53,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:53,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1450928142, now seen corresponding path program 3 times [2023-08-27 03:45:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867939650] [2023-08-27 03:45:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867939650] [2023-08-27 03:45:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867939650] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:45:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455695241] [2023-08-27 03:45:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:54,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:45:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:45:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:45:54,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-08-27 03:45:54,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 127 flow. Second operand has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:54,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:54,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-08-27 03:45:54,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:54,553 INFO L124 PetriNetUnfolderBase]: 66/161 cut-off events. [2023-08-27 03:45:54,553 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-08-27 03:45:54,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 161 events. 66/161 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 543 event pairs, 18 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 562. Up to 73 conditions per place. [2023-08-27 03:45:54,554 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 23 selfloop transitions, 3 changer transitions 22/50 dead transitions. [2023-08-27 03:45:54,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 347 flow [2023-08-27 03:45:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 665 transitions. [2023-08-27 03:45:54,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42035398230088494 [2023-08-27 03:45:54,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 665 transitions. [2023-08-27 03:45:54,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 665 transitions. [2023-08-27 03:45:54,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:54,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 665 transitions. [2023-08-27 03:45:54,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.0) internal successors, (665), 7 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:54,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:54,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:54,560 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 127 flow. Second operand 7 states and 665 transitions. [2023-08-27 03:45:54,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 347 flow [2023-08-27 03:45:54,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 329 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-27 03:45:54,562 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 130 flow [2023-08-27 03:45:54,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-27 03:45:54,563 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-27 03:45:54,563 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 130 flow [2023-08-27 03:45:54,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:54,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:54,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:54,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:45:54,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:54,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1883009558, now seen corresponding path program 4 times [2023-08-27 03:45:54,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141992257] [2023-08-27 03:45:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:54,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:45:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:54,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:45:54,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:45:54,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:45:54,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:45:54,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:45:54,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 03:45:54,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-27 03:45:54,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:45:54,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:45:54,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:45:54,672 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:54,675 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:45:54,675 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:45:54,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:45:54 BasicIcfg [2023-08-27 03:45:54,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:45:54,737 INFO L158 Benchmark]: Toolchain (without parser) took 7379.67ms. Allocated memory was 343.9MB in the beginning and 497.0MB in the end (delta: 153.1MB). Free memory was 318.8MB in the beginning and 286.9MB in the end (delta: 31.8MB). Peak memory consumption was 185.4MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,737 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 343.9MB. Free memory was 321.0MB in the beginning and 320.9MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:45:54,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.45ms. Allocated memory is still 343.9MB. Free memory was 318.8MB in the beginning and 296.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 293.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,738 INFO L158 Benchmark]: Boogie Preprocessor took 19.82ms. Allocated memory is still 343.9MB. Free memory was 293.6MB in the beginning and 291.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,738 INFO L158 Benchmark]: RCFGBuilder took 457.72ms. Allocated memory is still 343.9MB. Free memory was 291.5MB in the beginning and 258.5MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,739 INFO L158 Benchmark]: TraceAbstraction took 6467.58ms. Allocated memory was 343.9MB in the beginning and 497.0MB in the end (delta: 153.1MB). Free memory was 257.4MB in the beginning and 286.9MB in the end (delta: -29.5MB). Peak memory consumption was 124.6MB. Max. memory is 16.0GB. [2023-08-27 03:45:54,740 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 343.9MB. Free memory was 321.0MB in the beginning and 320.9MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 400.45ms. Allocated memory is still 343.9MB. Free memory was 318.8MB in the beginning and 296.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 343.9MB. Free memory was 296.3MB in the beginning and 293.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.82ms. Allocated memory is still 343.9MB. Free memory was 293.6MB in the beginning and 291.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 457.72ms. Allocated memory is still 343.9MB. Free memory was 291.5MB in the beginning and 258.5MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6467.58ms. Allocated memory was 343.9MB in the beginning and 497.0MB in the end (delta: 153.1MB). Free memory was 257.4MB in the beginning and 286.9MB in the end (delta: -29.5MB). Peak memory consumption was 124.6MB. 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.0s, 125 PlacesBefore, 40 PlacesAfterwards, 118 TransitionsBefore, 31 TransitionsAfterwards, 2696 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 9158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3956, independent: 3693, independent conditional: 0, independent unconditional: 3693, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1458, independent: 1420, independent conditional: 0, independent unconditional: 1420, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3956, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 1458, unknown conditional: 0, unknown unconditional: 1458] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [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$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-2, t922={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-1, t922={5:0}, t923={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=0, t922={5:0}, t923={6:0}, t924={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] EXPR 1 __unbuffered_cnt + 1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L785] EXPR 2 __unbuffered_cnt + 1 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L820] EXPR 3 __unbuffered_cnt + 1 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 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", "mix035_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 840]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 780 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 12 mSDtfsCounter, 780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=5, InterpolantAutomatonStates: 43, 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.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:45:54,763 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...