/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:49:32,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:49:32,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:49:32,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:49:32,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:49:32,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:49:32,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:49:32,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:49:32,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:49:32,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:49:32,341 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:49:32,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:49:32,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:49:32,343 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:49:32,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:49:32,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:49:32,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:49:32,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:49:32,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:49:32,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:49:32,344 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:49:32,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:49:32,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:49:32,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:49:32,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:49:32,345 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:49:32,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:49:32,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:32,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:49:32,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:49:32,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:49:32,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:49:32,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:49:32,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:49:32,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:49:32,348 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:49:32,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:49:32,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:49:32,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:49:32,690 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:49:32,691 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:49:32,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:49:33,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:49:34,119 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:49:34,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:49:34,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3b6917c/1e2b82c90d544a1cae3fa7963b4ea6d9/FLAG8446cd66d [2023-08-27 03:49:34,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3b6917c/1e2b82c90d544a1cae3fa7963b4ea6d9 [2023-08-27 03:49:34,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:49:34,172 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:49:34,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:34,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:49:34,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:49:34,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79eca12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34, skipping insertion in model container [2023-08-27 03:49:34,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:49:34,556 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:34,566 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:49:34,583 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:34,585 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:49:34,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:49:34,637 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:34,638 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:49:34,644 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:49:34,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34 WrapperNode [2023-08-27 03:49:34,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:49:34,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:34,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:49:34,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:49:34,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,709 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-08-27 03:49:34,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:49:34,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:49:34,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:49:34,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:49:34,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:49:34,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:49:34,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:49:34,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:49:34,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (1/1) ... [2023-08-27 03:49:34,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:49:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:49:34,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:49:34,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:49:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:49:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:49:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:49:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:49:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:49:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:49:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:49:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:49:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:49:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:49:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:49:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:49:34,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:49:34,831 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:49:34,941 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:49:34,944 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:49:35,318 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:49:35,464 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:49:35,464 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:49:35,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:35 BoogieIcfgContainer [2023-08-27 03:49:35,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:49:35,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:49:35,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:49:35,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:49:35,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:49:34" (1/3) ... [2023-08-27 03:49:35,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2465e2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:35, skipping insertion in model container [2023-08-27 03:49:35,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:49:34" (2/3) ... [2023-08-27 03:49:35,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2465e2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:49:35, skipping insertion in model container [2023-08-27 03:49:35,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:49:35" (3/3) ... [2023-08-27 03:49:35,472 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 03:49:35,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:49:35,487 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:49:35,487 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:49:35,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:49:35,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 200 flow [2023-08-27 03:49:35,586 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-27 03:49:35,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:35,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 03:49:35,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 200 flow [2023-08-27 03:49:35,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 93 transitions, 192 flow [2023-08-27 03:49:35,596 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:49:35,608 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-27 03:49:35,611 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 192 flow [2023-08-27 03:49:35,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 192 flow [2023-08-27 03:49:35,645 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-08-27 03:49:35,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:35,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 3/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-27 03:49:35,648 INFO L119 LiptonReduction]: Number of co-enabled transitions 1484 [2023-08-27 03:49:38,830 INFO L134 LiptonReduction]: Checked pairs total: 5000 [2023-08-27 03:49:38,831 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-27 03:49:38,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:49:38,848 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;@64ee516b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:49:38,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:49:38,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:49:38,852 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:49:38,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:49:38,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:38,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:49:38,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:38,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 434491495, now seen corresponding path program 1 times [2023-08-27 03:49:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434568286] [2023-08-27 03:49:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:39,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434568286] [2023-08-27 03:49:39,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434568286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:39,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:39,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360136877] [2023-08-27 03:49:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:39,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:39,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:39,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:39,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 181 [2023-08-27 03:49:39,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 181 [2023-08-27 03:49:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:39,473 INFO L124 PetriNetUnfolderBase]: 264/524 cut-off events. [2023-08-27 03:49:39,473 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 03:49:39,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 524 events. 264/524 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2660 event pairs, 32 based on Foata normal form. 25/426 useless extension candidates. Maximal degree in co-relation 980. Up to 373 conditions per place. [2023-08-27 03:49:39,482 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 26 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-27 03:49:39,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 126 flow [2023-08-27 03:49:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-08-27 03:49:39,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880294659300184 [2023-08-27 03:49:39,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-08-27 03:49:39,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-08-27 03:49:39,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:39,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-08-27 03:49:39,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,517 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 265 transitions. [2023-08-27 03:49:39,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 126 flow [2023-08-27 03:49:39,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:39,521 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 52 flow [2023-08-27 03:49:39,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2023-08-27 03:49:39,528 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-27 03:49:39,528 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 52 flow [2023-08-27 03:49:39,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:39,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:49:39,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:49:39,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:39,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 583333171, now seen corresponding path program 1 times [2023-08-27 03:49:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055394897] [2023-08-27 03:49:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055394897] [2023-08-27 03:49:39,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055394897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:39,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:39,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:49:39,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726583557] [2023-08-27 03:49:39,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:49:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:49:39,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:49:39,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 181 [2023-08-27 03:49:39,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:39,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 181 [2023-08-27 03:49:39,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:39,668 INFO L124 PetriNetUnfolderBase]: 93/202 cut-off events. [2023-08-27 03:49:39,669 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-27 03:49:39,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 202 events. 93/202 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 758 event pairs, 45 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 416. Up to 153 conditions per place. [2023-08-27 03:49:39,670 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 26 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-08-27 03:49:39,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 132 flow [2023-08-27 03:49:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:49:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:49:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2023-08-27 03:49:39,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47697974217311234 [2023-08-27 03:49:39,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 259 transitions. [2023-08-27 03:49:39,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 259 transitions. [2023-08-27 03:49:39,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:39,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 259 transitions. [2023-08-27 03:49:39,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,679 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 52 flow. Second operand 3 states and 259 transitions. [2023-08-27 03:49:39,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 132 flow [2023-08-27 03:49:39,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:39,681 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 75 flow [2023-08-27 03:49:39,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-08-27 03:49:39,681 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-27 03:49:39,682 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 75 flow [2023-08-27 03:49:39,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:39,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:39,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:49:39,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:39,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash 487255143, now seen corresponding path program 1 times [2023-08-27 03:49:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541344157] [2023-08-27 03:49:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541344157] [2023-08-27 03:49:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541344157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:39,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553892396] [2023-08-27 03:49:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:39,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:39,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:39,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:39,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 181 [2023-08-27 03:49:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:39,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 181 [2023-08-27 03:49:39,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:39,890 INFO L124 PetriNetUnfolderBase]: 81/176 cut-off events. [2023-08-27 03:49:39,890 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-27 03:49:39,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 176 events. 81/176 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 634 event pairs, 35 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 416. Up to 126 conditions per place. [2023-08-27 03:49:39,892 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 24 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-27 03:49:39,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 137 flow [2023-08-27 03:49:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-08-27 03:49:39,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544198895027624 [2023-08-27 03:49:39,894 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-08-27 03:49:39,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-08-27 03:49:39,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:39,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-08-27 03:49:39,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,899 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 75 flow. Second operand 4 states and 329 transitions. [2023-08-27 03:49:39,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 137 flow [2023-08-27 03:49:39,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:49:39,901 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 70 flow [2023-08-27 03:49:39,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-27 03:49:39,902 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-27 03:49:39,902 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 70 flow [2023-08-27 03:49:39,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:39,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:39,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:39,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:49:39,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:39,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 487255144, now seen corresponding path program 1 times [2023-08-27 03:49:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696365001] [2023-08-27 03:49:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696365001] [2023-08-27 03:49:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696365001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:49:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727232338] [2023-08-27 03:49:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:40,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:49:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:49:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:49:40,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 181 [2023-08-27 03:49:40,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:40,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 181 [2023-08-27 03:49:40,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:40,083 INFO L124 PetriNetUnfolderBase]: 39/90 cut-off events. [2023-08-27 03:49:40,083 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-27 03:49:40,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 90 events. 39/90 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 252 event pairs, 20 based on Foata normal form. 6/91 useless extension candidates. Maximal degree in co-relation 212. Up to 45 conditions per place. [2023-08-27 03:49:40,085 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 17 selfloop transitions, 5 changer transitions 4/28 dead transitions. [2023-08-27 03:49:40,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 132 flow [2023-08-27 03:49:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:49:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:49:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-08-27 03:49:40,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544198895027624 [2023-08-27 03:49:40,087 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-08-27 03:49:40,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-08-27 03:49:40,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:40,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-08-27 03:49:40,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,090 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,090 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 70 flow. Second operand 4 states and 329 transitions. [2023-08-27 03:49:40,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 132 flow [2023-08-27 03:49:40,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:40,092 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 70 flow [2023-08-27 03:49:40,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-08-27 03:49:40,094 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-27 03:49:40,094 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 70 flow [2023-08-27 03:49:40,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:40,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:40,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:49:40,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:40,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1883996590, now seen corresponding path program 1 times [2023-08-27 03:49:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307121747] [2023-08-27 03:49:40,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:40,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307121747] [2023-08-27 03:49:40,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307121747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:40,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:40,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:49:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006476684] [2023-08-27 03:49:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:40,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:49:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:49:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:49:40,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 181 [2023-08-27 03:49:40,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:40,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 181 [2023-08-27 03:49:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:40,513 INFO L124 PetriNetUnfolderBase]: 21/73 cut-off events. [2023-08-27 03:49:40,518 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-27 03:49:40,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 73 events. 21/73 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 0 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 198. Up to 40 conditions per place. [2023-08-27 03:49:40,520 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 18 selfloop transitions, 1 changer transitions 13/33 dead transitions. [2023-08-27 03:49:40,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 198 flow [2023-08-27 03:49:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:49:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:49:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 394 transitions. [2023-08-27 03:49:40,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353591160220994 [2023-08-27 03:49:40,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 394 transitions. [2023-08-27 03:49:40,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 394 transitions. [2023-08-27 03:49:40,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:40,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 394 transitions. [2023-08-27 03:49:40,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,526 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,527 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 70 flow. Second operand 5 states and 394 transitions. [2023-08-27 03:49:40,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 198 flow [2023-08-27 03:49:40,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 179 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 03:49:40,530 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 69 flow [2023-08-27 03:49:40,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2023-08-27 03:49:40,532 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-27 03:49:40,532 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 69 flow [2023-08-27 03:49:40,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:40,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:40,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:49:40,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:40,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 666307746, now seen corresponding path program 2 times [2023-08-27 03:49:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479954431] [2023-08-27 03:49:40,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:40,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:49:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:49:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:49:41,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479954431] [2023-08-27 03:49:41,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479954431] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:49:41,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:49:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:49:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788970958] [2023-08-27 03:49:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:49:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:49:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:49:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:49:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:49:41,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 181 [2023-08-27 03:49:41,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 69 flow. Second operand has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:41,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:49:41,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 181 [2023-08-27 03:49:41,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:49:41,970 INFO L124 PetriNetUnfolderBase]: 21/70 cut-off events. [2023-08-27 03:49:41,970 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-27 03:49:41,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 70 events. 21/70 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 2 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 207. Up to 20 conditions per place. [2023-08-27 03:49:41,970 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 16 selfloop transitions, 3 changer transitions 17/37 dead transitions. [2023-08-27 03:49:41,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 217 flow [2023-08-27 03:49:41,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:49:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:49:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 577 transitions. [2023-08-27 03:49:41,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39848066298342544 [2023-08-27 03:49:41,973 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 577 transitions. [2023-08-27 03:49:41,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 577 transitions. [2023-08-27 03:49:41,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:49:41,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 577 transitions. [2023-08-27 03:49:41,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 72.125) internal successors, (577), 8 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:41,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:41,977 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:41,978 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 69 flow. Second operand 8 states and 577 transitions. [2023-08-27 03:49:41,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 217 flow [2023-08-27 03:49:41,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 208 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 03:49:41,979 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 81 flow [2023-08-27 03:49:41,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2023-08-27 03:49:41,980 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-08-27 03:49:41,980 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 81 flow [2023-08-27 03:49:41,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.66666666666667) internal successors, (627), 9 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:49:41,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:49:41,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:49:41,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:49:41,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:49:41,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:49:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1966216198, now seen corresponding path program 3 times [2023-08-27 03:49:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:49:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307209909] [2023-08-27 03:49:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:49:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:49:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:49:42,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:49:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:49:42,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:49:42,065 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:49:42,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:49:42,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:49:42,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:49:42,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:49:42,070 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-08-27 03:49:42,075 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:49:42,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:49:42,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:49:42 BasicIcfg [2023-08-27 03:49:42,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:49:42,141 INFO L158 Benchmark]: Toolchain (without parser) took 7969.32ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 322.5MB in the beginning and 207.2MB in the end (delta: 115.3MB). Peak memory consumption was 195.8MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,141 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory is still 324.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:49:42,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.70ms. Allocated memory is still 348.1MB. Free memory was 322.5MB in the beginning and 299.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.52ms. Allocated memory is still 348.1MB. Free memory was 299.8MB in the beginning and 297.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,142 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 348.1MB. Free memory was 297.4MB in the beginning and 295.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,142 INFO L158 Benchmark]: RCFGBuilder took 726.90ms. Allocated memory is still 348.1MB. Free memory was 295.3MB in the beginning and 318.3MB in the end (delta: -23.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,143 INFO L158 Benchmark]: TraceAbstraction took 6673.14ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 317.3MB in the beginning and 207.2MB in the end (delta: 110.1MB). Peak memory consumption was 189.8MB. Max. memory is 16.0GB. [2023-08-27 03:49:42,144 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 348.1MB. Free memory is still 324.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.70ms. Allocated memory is still 348.1MB. Free memory was 322.5MB in the beginning and 299.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.52ms. Allocated memory is still 348.1MB. Free memory was 299.8MB in the beginning and 297.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 348.1MB. Free memory was 297.4MB in the beginning and 295.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 726.90ms. Allocated memory is still 348.1MB. Free memory was 295.3MB in the beginning and 318.3MB in the end (delta: -23.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.0GB. * TraceAbstraction took 6673.14ms. Allocated memory was 348.1MB in the beginning and 427.8MB in the end (delta: 79.7MB). Free memory was 317.3MB in the beginning and 207.2MB in the end (delta: 110.1MB). Peak memory consumption was 189.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 97 PlacesBefore, 30 PlacesAfterwards, 93 TransitionsBefore, 24 TransitionsAfterwards, 1484 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 5000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2329, independent: 2125, independent conditional: 0, independent unconditional: 2125, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 817, independent: 790, independent conditional: 0, independent unconditional: 790, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2329, independent: 1335, independent conditional: 0, independent unconditional: 1335, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 817, unknown conditional: 0, unknown unconditional: 817] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] EXPR 2 __unbuffered_cnt + 1 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L749] EXPR 1 __unbuffered_cnt + 1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 749]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 116 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 5 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 356 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 03:49:42,175 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...