/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 PROGRAM_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/safe014_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:15:42,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:15:42,942 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 10:15:42,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:15:42,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:15:42,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:15:42,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:15:42,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:15:42,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:15:42,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:15:42,968 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:15:42,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:15:42,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:15:42,969 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:15:42,969 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:15:42,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:15:42,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:15:42,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:15:42,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:15:42,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:15:42,971 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:15:42,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:15:42,972 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:15:42,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:15:42,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:15:42,972 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:15:42,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:15:42,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:15:42,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:15:42,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:15:42,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:15:42,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:15:42,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:15:42,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:15:42,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:15:42,975 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 -> PROGRAM_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 10:15:43,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:15:43,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:15:43,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:15:43,366 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:15:43,366 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:15:43,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-08-27 10:15:44,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:15:44,758 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:15:44,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i [2023-08-27 10:15:44,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a3a6345/24e64243bbcd4106a969e83d817e7fa1/FLAGf4b0ce8d6 [2023-08-27 10:15:44,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a3a6345/24e64243bbcd4106a969e83d817e7fa1 [2023-08-27 10:15:44,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:15:44,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:15:44,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:15:44,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:15:44,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:15:44,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:15:44" (1/1) ... [2023-08-27 10:15:44,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494d3700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:44, skipping insertion in model container [2023-08-27 10:15:44,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:15:44" (1/1) ... [2023-08-27 10:15:44,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:15:45,224 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:15:45,239 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:15:45,265 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:15:45,267 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:15:45,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:15:45,357 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:15:45,357 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:15:45,363 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:15:45,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45 WrapperNode [2023-08-27 10:15:45,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:15:45,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:15:45,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:15:45,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:15:45,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,439 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-27 10:15:45,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:15:45,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:15:45,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:15:45,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:15:45,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:15:45,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:15:45,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:15:45,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:15:45,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (1/1) ... [2023-08-27 10:15:45,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:15:45,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:15:45,535 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 10:15:45,550 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 10:15:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:15:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:15:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:15:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:15:45,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:15:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:15:45,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:15:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:15:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:15:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:15:45,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:15:45,578 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 10:15:45,738 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:15:45,739 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:15:46,079 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:15:46,310 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:15:46,311 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:15:46,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:15:46 BoogieIcfgContainer [2023-08-27 10:15:46,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:15:46,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:15:46,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:15:46,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:15:46,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:15:44" (1/3) ... [2023-08-27 10:15:46,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a390632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:15:46, skipping insertion in model container [2023-08-27 10:15:46,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:15:45" (2/3) ... [2023-08-27 10:15:46,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a390632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:15:46, skipping insertion in model container [2023-08-27 10:15:46,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:15:46" (3/3) ... [2023-08-27 10:15:46,320 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i [2023-08-27 10:15:46,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:15:46,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-27 10:15:46,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:15:46,411 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:15:46,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:15:46,526 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:15:46,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:46,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:15:46,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 10:15:46,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-27 10:15:46,540 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:15:46,552 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:15:46,556 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 10:15:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-27 10:15:46,605 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 10:15:46,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:46,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 10:15:46,609 INFO L119 LiptonReduction]: Number of co-enabled transitions 2402 [2023-08-27 10:15:53,357 INFO L134 LiptonReduction]: Checked pairs total: 8276 [2023-08-27 10:15:53,358 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-27 10:15:53,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:15:53,374 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;@36a1046a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:15:53,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-27 10:15:53,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:15:53,379 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:15:53,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:15:53,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:53,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:15:53,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:53,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash 719674975, now seen corresponding path program 1 times [2023-08-27 10:15:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:53,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640895734] [2023-08-27 10:15:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:53,740 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 10:15:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640895734] [2023-08-27 10:15:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640895734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:15:53,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107866708] [2023-08-27 10:15:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:53,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:15:53,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:15:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:15:53,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:15:53,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:53,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:53,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:15:53,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:54,059 INFO L124 PetriNetUnfolderBase]: 902/1457 cut-off events. [2023-08-27 10:15:54,060 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-27 10:15:54,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2945 conditions, 1457 events. 902/1457 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8054 event pairs, 442 based on Foata normal form. 82/978 useless extension candidates. Maximal degree in co-relation 2934. Up to 1374 conditions per place. [2023-08-27 10:15:54,071 INFO L140 encePairwiseOnDemand]: 241/253 looper letters, 33 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-27 10:15:54,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 169 flow [2023-08-27 10:15:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:15:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:15:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-27 10:15:54,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5032938076416338 [2023-08-27 10:15:54,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-27 10:15:54,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-27 10:15:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:54,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-27 10:15:54,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 10:15:54,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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 10:15:54,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 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 10:15:54,097 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 382 transitions. [2023-08-27 10:15:54,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 169 flow [2023-08-27 10:15:54,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:15:54,101 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 100 flow [2023-08-27 10:15:54,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 10:15:54,106 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-27 10:15:54,106 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 100 flow [2023-08-27 10:15:54,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:15:54,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:54,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:54,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:15:54,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:54,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1750867487, now seen corresponding path program 1 times [2023-08-27 10:15:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293184650] [2023-08-27 10:15:54,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:54,197 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 10:15:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293184650] [2023-08-27 10:15:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293184650] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:54,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289869244] [2023-08-27 10:15:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:54,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:54,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:54,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:54,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:15:54,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 10:15:54,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:54,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:15:54,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:54,439 INFO L124 PetriNetUnfolderBase]: 581/950 cut-off events. [2023-08-27 10:15:54,439 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2023-08-27 10:15:54,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 950 events. 581/950 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4687 event pairs, 228 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 2374. Up to 866 conditions per place. [2023-08-27 10:15:54,446 INFO L140 encePairwiseOnDemand]: 246/253 looper letters, 30 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-08-27 10:15:54,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 178 flow [2023-08-27 10:15:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-27 10:15:54,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4792490118577075 [2023-08-27 10:15:54,449 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-27 10:15:54,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-27 10:15:54,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:54,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-27 10:15:54,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 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 10:15:54,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 10:15:54,454 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 10:15:54,455 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 100 flow. Second operand 4 states and 485 transitions. [2023-08-27 10:15:54,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 178 flow [2023-08-27 10:15:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:15:54,456 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 92 flow [2023-08-27 10:15:54,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-27 10:15:54,457 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-08-27 10:15:54,457 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 92 flow [2023-08-27 10:15:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 10:15:54,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:54,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:54,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:15:54,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:54,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1750867488, now seen corresponding path program 1 times [2023-08-27 10:15:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197512415] [2023-08-27 10:15:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:54,543 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 10:15:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197512415] [2023-08-27 10:15:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197512415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:15:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860778848] [2023-08-27 10:15:54,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:54,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:15:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:15:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:15:54,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:15:54,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 10:15:54,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:54,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:15:54,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:54,691 INFO L124 PetriNetUnfolderBase]: 196/362 cut-off events. [2023-08-27 10:15:54,691 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-27 10:15:54,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 362 events. 196/362 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1382 event pairs, 59 based on Foata normal form. 16/339 useless extension candidates. Maximal degree in co-relation 905. Up to 171 conditions per place. [2023-08-27 10:15:54,694 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-27 10:15:54,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 230 flow [2023-08-27 10:15:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:15:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:15:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-08-27 10:15:54,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4901185770750988 [2023-08-27 10:15:54,696 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-08-27 10:15:54,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-08-27 10:15:54,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:54,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-08-27 10:15:54,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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 10:15:54,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 10:15:54,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 253.0) internal successors, (1265), 5 states have internal predecessors, (1265), 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 10:15:54,701 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 92 flow. Second operand 4 states and 496 transitions. [2023-08-27 10:15:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 230 flow [2023-08-27 10:15:54,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:54,703 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 133 flow [2023-08-27 10:15:54,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-27 10:15:54,703 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-27 10:15:54,704 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 133 flow [2023-08-27 10:15:54,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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 10:15:54,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:54,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:54,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:15:54,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:54,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1818458098, now seen corresponding path program 1 times [2023-08-27 10:15:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289598040] [2023-08-27 10:15:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:54,804 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 10:15:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289598040] [2023-08-27 10:15:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289598040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:15:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156415640] [2023-08-27 10:15:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:54,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:15:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:54,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:15:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:15:54,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 253 [2023-08-27 10:15:54,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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 10:15:54,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:54,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 253 [2023-08-27 10:15:54,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:54,922 INFO L124 PetriNetUnfolderBase]: 143/253 cut-off events. [2023-08-27 10:15:54,922 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-08-27 10:15:54,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 253 events. 143/253 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 858 event pairs, 39 based on Foata normal form. 7/252 useless extension candidates. Maximal degree in co-relation 754. Up to 108 conditions per place. [2023-08-27 10:15:54,924 INFO L140 encePairwiseOnDemand]: 245/253 looper letters, 27 selfloop transitions, 10 changer transitions 5/45 dead transitions. [2023-08-27 10:15:54,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 239 flow [2023-08-27 10:15:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:15:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:15:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2023-08-27 10:15:54,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790513833992095 [2023-08-27 10:15:54,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2023-08-27 10:15:54,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2023-08-27 10:15:54,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:54,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2023-08-27 10:15:54,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 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 10:15:54,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 10:15:54,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 10:15:54,930 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 133 flow. Second operand 5 states and 606 transitions. [2023-08-27 10:15:54,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 239 flow [2023-08-27 10:15:54,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 225 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-27 10:15:54,933 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 125 flow [2023-08-27 10:15:54,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-27 10:15:54,934 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2023-08-27 10:15:54,934 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 125 flow [2023-08-27 10:15:54,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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 10:15:54,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:54,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:54,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:15:54,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:54,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 518418578, now seen corresponding path program 1 times [2023-08-27 10:15:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833097616] [2023-08-27 10:15:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:55,226 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 10:15:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833097616] [2023-08-27 10:15:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833097616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:15:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934209054] [2023-08-27 10:15:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:15:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:55,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:15:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:15:55,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-08-27 10:15:55,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 10:15:55,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:55,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-08-27 10:15:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:55,370 INFO L124 PetriNetUnfolderBase]: 171/330 cut-off events. [2023-08-27 10:15:55,370 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2023-08-27 10:15:55,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 330 events. 171/330 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1276 event pairs, 73 based on Foata normal form. 1/331 useless extension candidates. Maximal degree in co-relation 1035. Up to 183 conditions per place. [2023-08-27 10:15:55,372 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 32 selfloop transitions, 2 changer transitions 26/61 dead transitions. [2023-08-27 10:15:55,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 432 flow [2023-08-27 10:15:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:15:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:15:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-08-27 10:15:55,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46047430830039526 [2023-08-27 10:15:55,374 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-08-27 10:15:55,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-08-27 10:15:55,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:55,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-08-27 10:15:55,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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 10:15:55,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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 10:15:55,379 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 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 10:15:55,379 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 125 flow. Second operand 6 states and 699 transitions. [2023-08-27 10:15:55,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 432 flow [2023-08-27 10:15:55,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 370 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 10:15:55,383 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 111 flow [2023-08-27 10:15:55,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-27 10:15:55,383 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-27 10:15:55,384 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 111 flow [2023-08-27 10:15:55,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 10:15:55,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:55,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:15:55,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:55,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2056572918, now seen corresponding path program 2 times [2023-08-27 10:15:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664940055] [2023-08-27 10:15:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:15:55,607 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 10:15:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:15:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664940055] [2023-08-27 10:15:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664940055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:15:55,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:15:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:15:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127888723] [2023-08-27 10:15:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:15:55,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:15:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:15:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:15:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:15:55,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 253 [2023-08-27 10:15:55,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 10:15:55,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:15:55,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 253 [2023-08-27 10:15:55,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:15:55,733 INFO L124 PetriNetUnfolderBase]: 165/329 cut-off events. [2023-08-27 10:15:55,733 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2023-08-27 10:15:55,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 329 events. 165/329 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1283 event pairs, 32 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1062. Up to 170 conditions per place. [2023-08-27 10:15:55,735 INFO L140 encePairwiseOnDemand]: 248/253 looper letters, 34 selfloop transitions, 3 changer transitions 14/52 dead transitions. [2023-08-27 10:15:55,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 333 flow [2023-08-27 10:15:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:15:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:15:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-27 10:15:55,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2023-08-27 10:15:55,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-27 10:15:55,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-27 10:15:55,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:15:55,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-27 10:15:55,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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 10:15:55,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 10:15:55,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 253.0) internal successors, (1518), 6 states have internal predecessors, (1518), 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 10:15:55,740 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 111 flow. Second operand 5 states and 583 transitions. [2023-08-27 10:15:55,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 333 flow [2023-08-27 10:15:55,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 321 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 10:15:55,743 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 115 flow [2023-08-27 10:15:55,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=253, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-27 10:15:55,743 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-27 10:15:55,744 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 115 flow [2023-08-27 10:15:55,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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 10:15:55,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:15:55,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:15:55,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:15:55,744 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 10:15:55,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:15:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1145462654, now seen corresponding path program 3 times [2023-08-27 10:15:55,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:15:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276838790] [2023-08-27 10:15:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:15:55,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:15:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:15:55,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:15:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:15:55,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:15:55,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:15:55,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-27 10:15:55,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-27 10:15:55,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-27 10:15:55,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-27 10:15:55,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-27 10:15:55,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-27 10:15:55,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-27 10:15:55,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-27 10:15:55,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-27 10:15:55,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:15:55,928 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-08-27 10:15:55,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:15:55,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:15:56,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:15:56 BasicIcfg [2023-08-27 10:15:56,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:15:56,044 INFO L158 Benchmark]: Toolchain (without parser) took 11254.29ms. Allocated memory was 354.4MB in the beginning and 664.8MB in the end (delta: 310.4MB). Free memory was 329.4MB in the beginning and 507.9MB in the end (delta: -178.5MB). Peak memory consumption was 132.4MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,044 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:15:56,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.66ms. Allocated memory is still 354.4MB. Free memory was 328.9MB in the beginning and 305.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.24ms. Allocated memory is still 354.4MB. Free memory was 305.8MB in the beginning and 303.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,044 INFO L158 Benchmark]: Boogie Preprocessor took 54.38ms. Allocated memory is still 354.4MB. Free memory was 303.2MB in the beginning and 301.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,045 INFO L158 Benchmark]: RCFGBuilder took 817.82ms. Allocated memory was 354.4MB in the beginning and 515.9MB in the end (delta: 161.5MB). Free memory was 301.1MB in the beginning and 471.0MB in the end (delta: -169.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,045 INFO L158 Benchmark]: TraceAbstraction took 9725.01ms. Allocated memory was 515.9MB in the beginning and 664.8MB in the end (delta: 148.9MB). Free memory was 470.0MB in the beginning and 507.9MB in the end (delta: -37.9MB). Peak memory consumption was 110.0MB. Max. memory is 16.0GB. [2023-08-27 10:15:56,046 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.13ms. Allocated memory is still 354.4MB. Free memory is still 332.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 578.66ms. Allocated memory is still 354.4MB. Free memory was 328.9MB in the beginning and 305.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.24ms. Allocated memory is still 354.4MB. Free memory was 305.8MB in the beginning and 303.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.38ms. Allocated memory is still 354.4MB. Free memory was 303.2MB in the beginning and 301.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 817.82ms. Allocated memory was 354.4MB in the beginning and 515.9MB in the end (delta: 161.5MB). Free memory was 301.1MB in the beginning and 471.0MB in the end (delta: -169.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.0GB. * TraceAbstraction took 9725.01ms. Allocated memory was 515.9MB in the beginning and 664.8MB in the end (delta: 148.9MB). Free memory was 470.0MB in the beginning and 507.9MB in the end (delta: -37.9MB). Peak memory consumption was 110.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 138 PlacesBefore, 38 PlacesAfterwards, 131 TransitionsBefore, 29 TransitionsAfterwards, 2402 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 8276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2736, independent: 2469, independent conditional: 0, independent unconditional: 2469, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1254, independent: 1210, independent conditional: 0, independent unconditional: 1210, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2736, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 1254, unknown conditional: 0, unknown unconditional: 1254] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L835] 0 pthread_t t2097; [L836] FCALL, FORK 0 pthread_create(&t2097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2097, ((void *)0), P0, ((void *)0))=0, t2097={6:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L837] 0 pthread_t t2098; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] EXPR 1 \read(y) [L766] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L766] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L767] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L768] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L769] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L775] EXPR 1 \read(y) [L775] 1 __unbuffered_p0_EAX = y [L776] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L776] 1 y = y$flush_delayed ? y$mem_tmp : y [L777] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L838] FCALL, FORK 0 pthread_create(&t2098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2098, ((void *)0), P1, ((void *)0))=1, t2097={6:0}, t2098={8:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L839] 0 pthread_t t2099; [L785] EXPR 1 __unbuffered_cnt + 1 [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L840] FCALL, FORK 0 pthread_create(&t2099, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2099, ((void *)0), P2, ((void *)0))=2, t2097={6:0}, t2098={8:0}, t2099={9:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, 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={3:0}] [L792] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, 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=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={3:0}] [L795] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L800] EXPR 2 __unbuffered_cnt + 1 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L807] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L810] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3: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) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097={6:0}, t2098={8:0}, t2099={9:0}, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] [L853] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L854] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L854] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L857] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe014_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice1=1, weak$$choice2=1, x=2, 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={3:0}] - 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: 800]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 800]: 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: 820]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur 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: 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: 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, 163 locations, 16 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: 9.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 411 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 7 mSDtfsCounter, 411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 10:15:56,072 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...