/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/mix031.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:45:05,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:45:05,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:45:05,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:45:05,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:45:05,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:45:05,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:45:05,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:45:05,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:45:05,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:45:05,124 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:45:05,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:45:05,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:45:05,125 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:45:05,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:45:05,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:45:05,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:45:05,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:45:05,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:45:05,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:45:05,127 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:45:05,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:45:05,127 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:45:05,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:45:05,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:45:05,128 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:45:05,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:45:05,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:05,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:45:05,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:45:05,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:45:05,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:45:05,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:45:05,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:45:05,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:45:05,131 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:45:05,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:45:05,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:45:05,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:45:05,458 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:45:05,459 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:45:05,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-27 03:45:06,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:45:06,944 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:45:06,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2023-08-27 03:45:06,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be8246f1/613a61fa7a5e4dc9b31d9bf366b28b82/FLAG90ccbad0a [2023-08-27 03:45:06,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be8246f1/613a61fa7a5e4dc9b31d9bf366b28b82 [2023-08-27 03:45:06,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:45:06,979 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:45:06,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:06,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:45:06,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:45:06,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:06" (1/1) ... [2023-08-27 03:45:06,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10954420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:06, skipping insertion in model container [2023-08-27 03:45:06,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:06" (1/1) ... [2023-08-27 03:45:07,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:45:07,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:07,448 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:45:07,477 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:07,479 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:07,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:07,549 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:07,550 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:07,556 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:45:07,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07 WrapperNode [2023-08-27 03:45:07,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:07,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:07,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:45:07,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:45:07,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,630 INFO L138 Inliner]: procedures = 175, calls = 50, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2023-08-27 03:45:07,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:07,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:45:07,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:45:07,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:45:07,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:45:07,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:45:07,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:45:07,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:45:07,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (1/1) ... [2023-08-27 03:45:07,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:07,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:45:07,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:45:07,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:45:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:45:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:45:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:45:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:45:07,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:45:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:45:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:45:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:45:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:45:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:45:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:45:07,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:45:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:45:07,771 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:45:07,883 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:45:07,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:45:08,168 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:45:08,388 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:45:08,388 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:45:08,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:08 BoogieIcfgContainer [2023-08-27 03:45:08,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:45:08,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:45:08,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:45:08,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:45:08,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:45:06" (1/3) ... [2023-08-27 03:45:08,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2542b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:08, skipping insertion in model container [2023-08-27 03:45:08,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:07" (2/3) ... [2023-08-27 03:45:08,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2542b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:08, skipping insertion in model container [2023-08-27 03:45:08,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:08" (3/3) ... [2023-08-27 03:45:08,400 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2023-08-27 03:45:08,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:45:08,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 03:45:08,417 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:45:08,470 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:45:08,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 218 flow [2023-08-27 03:45:08,551 INFO L124 PetriNetUnfolderBase]: 3/102 cut-off events. [2023-08-27 03:45:08,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:08,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-27 03:45:08,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 218 flow [2023-08-27 03:45:08,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 102 transitions, 210 flow [2023-08-27 03:45:08,568 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:45:08,581 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 102 transitions, 210 flow [2023-08-27 03:45:08,584 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 102 transitions, 210 flow [2023-08-27 03:45:08,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 102 transitions, 210 flow [2023-08-27 03:45:08,619 INFO L124 PetriNetUnfolderBase]: 3/102 cut-off events. [2023-08-27 03:45:08,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:08,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-27 03:45:08,629 INFO L119 LiptonReduction]: Number of co-enabled transitions 1858 [2023-08-27 03:45:11,904 INFO L134 LiptonReduction]: Checked pairs total: 6429 [2023-08-27 03:45:11,905 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-27 03:45:11,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:45:11,923 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;@5be31b9d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:45:11,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 03:45:11,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:45:11,925 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:45:11,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:11,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:11,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:45:11,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:11,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash 479651, now seen corresponding path program 1 times [2023-08-27 03:45:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845230082] [2023-08-27 03:45:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:11,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845230082] [2023-08-27 03:45:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845230082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:12,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113241614] [2023-08-27 03:45:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:12,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:12,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:12,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 197 [2023-08-27 03:45:12,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:12,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 197 [2023-08-27 03:45:12,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:12,481 INFO L124 PetriNetUnfolderBase]: 322/685 cut-off events. [2023-08-27 03:45:12,482 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-27 03:45:12,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 685 events. 322/685 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3891 event pairs, 30 based on Foata normal form. 30/575 useless extension candidates. Maximal degree in co-relation 1234. Up to 469 conditions per place. [2023-08-27 03:45:12,488 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-27 03:45:12,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 147 flow [2023-08-27 03:45:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-27 03:45:12,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008460236886633 [2023-08-27 03:45:12,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-27 03:45:12,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-27 03:45:12,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:12,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-27 03:45:12,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,514 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-08-27 03:45:12,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 147 flow [2023-08-27 03:45:12,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:12,517 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 56 flow [2023-08-27 03:45:12,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-27 03:45:12,522 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-27 03:45:12,522 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 56 flow [2023-08-27 03:45:12,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:12,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:45:12,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:12,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 611414389, now seen corresponding path program 1 times [2023-08-27 03:45:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660149678] [2023-08-27 03:45:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660149678] [2023-08-27 03:45:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660149678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007925409] [2023-08-27 03:45:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:12,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:12,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-27 03:45:12,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:12,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-27 03:45:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:12,669 INFO L124 PetriNetUnfolderBase]: 108/235 cut-off events. [2023-08-27 03:45:12,670 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-27 03:45:12,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 235 events. 108/235 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 912 event pairs, 52 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 481. Up to 168 conditions per place. [2023-08-27 03:45:12,672 INFO L140 encePairwiseOnDemand]: 189/197 looper letters, 28 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-27 03:45:12,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 142 flow [2023-08-27 03:45:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-27 03:45:12,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4873096446700508 [2023-08-27 03:45:12,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-27 03:45:12,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-27 03:45:12,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:12,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-27 03:45:12,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,678 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 56 flow. Second operand 3 states and 288 transitions. [2023-08-27 03:45:12,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 142 flow [2023-08-27 03:45:12,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:12,680 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 79 flow [2023-08-27 03:45:12,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2023-08-27 03:45:12,681 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-27 03:45:12,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 79 flow [2023-08-27 03:45:12,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:12,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:12,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:12,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:45:12,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:12,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1479527593, now seen corresponding path program 1 times [2023-08-27 03:45:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:12,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308018280] [2023-08-27 03:45:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:13,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308018280] [2023-08-27 03:45:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308018280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:13,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342368586] [2023-08-27 03:45:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:13,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 197 [2023-08-27 03:45:13,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 79 flow. Second operand has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:13,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 197 [2023-08-27 03:45:13,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:13,375 INFO L124 PetriNetUnfolderBase]: 161/326 cut-off events. [2023-08-27 03:45:13,375 INFO L125 PetriNetUnfolderBase]: For 22/27 co-relation queries the response was YES. [2023-08-27 03:45:13,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 326 events. 161/326 cut-off events. For 22/27 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1218 event pairs, 28 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 749. Up to 207 conditions per place. [2023-08-27 03:45:13,378 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 42 selfloop transitions, 8 changer transitions 2/54 dead transitions. [2023-08-27 03:45:13,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 254 flow [2023-08-27 03:45:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2023-08-27 03:45:13,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42978003384094754 [2023-08-27 03:45:13,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2023-08-27 03:45:13,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2023-08-27 03:45:13,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:13,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2023-08-27 03:45:13,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,387 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 79 flow. Second operand 6 states and 508 transitions. [2023-08-27 03:45:13,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 54 transitions, 254 flow [2023-08-27 03:45:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:13,389 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 132 flow [2023-08-27 03:45:13,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-27 03:45:13,390 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2023-08-27 03:45:13,390 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 132 flow [2023-08-27 03:45:13,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:13,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:13,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:45:13,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:13,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1504757042, now seen corresponding path program 1 times [2023-08-27 03:45:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726131844] [2023-08-27 03:45:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726131844] [2023-08-27 03:45:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726131844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644960082] [2023-08-27 03:45:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:13,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:13,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-27 03:45:13,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:13,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-27 03:45:13,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:13,680 INFO L124 PetriNetUnfolderBase]: 163/331 cut-off events. [2023-08-27 03:45:13,680 INFO L125 PetriNetUnfolderBase]: For 161/167 co-relation queries the response was YES. [2023-08-27 03:45:13,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 331 events. 163/331 cut-off events. For 161/167 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1244 event pairs, 49 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 893. Up to 223 conditions per place. [2023-08-27 03:45:13,683 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 48 selfloop transitions, 6 changer transitions 2/58 dead transitions. [2023-08-27 03:45:13,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 336 flow [2023-08-27 03:45:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 439 transitions. [2023-08-27 03:45:13,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44568527918781725 [2023-08-27 03:45:13,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 439 transitions. [2023-08-27 03:45:13,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 439 transitions. [2023-08-27 03:45:13,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:13,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 439 transitions. [2023-08-27 03:45:13,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,690 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 132 flow. Second operand 5 states and 439 transitions. [2023-08-27 03:45:13,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 336 flow [2023-08-27 03:45:13,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:45:13,696 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 176 flow [2023-08-27 03:45:13,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-08-27 03:45:13,697 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2023-08-27 03:45:13,697 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 176 flow [2023-08-27 03:45:13,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:13,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:13,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:45:13,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:13,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 293690508, now seen corresponding path program 1 times [2023-08-27 03:45:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246646148] [2023-08-27 03:45:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:13,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246646148] [2023-08-27 03:45:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246646148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:13,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722802481] [2023-08-27 03:45:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:13,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:13,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-27 03:45:13,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:13,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-27 03:45:13,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:13,857 INFO L124 PetriNetUnfolderBase]: 107/232 cut-off events. [2023-08-27 03:45:13,861 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2023-08-27 03:45:13,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 232 events. 107/232 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 887 event pairs, 34 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 707. Up to 157 conditions per place. [2023-08-27 03:45:13,864 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 32 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-27 03:45:13,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 260 flow [2023-08-27 03:45:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-08-27 03:45:13,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573604060913704 [2023-08-27 03:45:13,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-08-27 03:45:13,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-08-27 03:45:13,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:13,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-08-27 03:45:13,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,869 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 176 flow. Second operand 4 states and 367 transitions. [2023-08-27 03:45:13,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 260 flow [2023-08-27 03:45:13,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:45:13,874 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 174 flow [2023-08-27 03:45:13,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-08-27 03:45:13,876 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-08-27 03:45:13,876 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 174 flow [2023-08-27 03:45:13,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:13,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:13,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:45:13,877 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:13,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1609443769, now seen corresponding path program 1 times [2023-08-27 03:45:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888991725] [2023-08-27 03:45:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888991725] [2023-08-27 03:45:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888991725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266566687] [2023-08-27 03:45:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:13,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:13,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-27 03:45:13,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:13,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:13,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-27 03:45:13,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:14,021 INFO L124 PetriNetUnfolderBase]: 53/117 cut-off events. [2023-08-27 03:45:14,022 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2023-08-27 03:45:14,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 117 events. 53/117 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 356 event pairs, 19 based on Foata normal form. 7/121 useless extension candidates. Maximal degree in co-relation 337. Up to 62 conditions per place. [2023-08-27 03:45:14,023 INFO L140 encePairwiseOnDemand]: 191/197 looper letters, 21 selfloop transitions, 5 changer transitions 4/34 dead transitions. [2023-08-27 03:45:14,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 208 flow [2023-08-27 03:45:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2023-08-27 03:45:14,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573604060913704 [2023-08-27 03:45:14,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 367 transitions. [2023-08-27 03:45:14,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 367 transitions. [2023-08-27 03:45:14,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:14,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 367 transitions. [2023-08-27 03:45:14,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,029 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 174 flow. Second operand 4 states and 367 transitions. [2023-08-27 03:45:14,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 208 flow [2023-08-27 03:45:14,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 172 flow, removed 6 selfloop flow, removed 12 redundant places. [2023-08-27 03:45:14,031 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 98 flow [2023-08-27 03:45:14,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-27 03:45:14,033 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2023-08-27 03:45:14,036 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 98 flow [2023-08-27 03:45:14,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:14,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:14,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:45:14,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:14,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash -3540812, now seen corresponding path program 1 times [2023-08-27 03:45:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888144536] [2023-08-27 03:45:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888144536] [2023-08-27 03:45:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888144536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153457914] [2023-08-27 03:45:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:14,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 197 [2023-08-27 03:45:14,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:14,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 197 [2023-08-27 03:45:14,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:14,656 INFO L124 PetriNetUnfolderBase]: 44/122 cut-off events. [2023-08-27 03:45:14,657 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-08-27 03:45:14,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 122 events. 44/122 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 360 event pairs, 5 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 372. Up to 40 conditions per place. [2023-08-27 03:45:14,658 INFO L140 encePairwiseOnDemand]: 187/197 looper letters, 32 selfloop transitions, 11 changer transitions 15/58 dead transitions. [2023-08-27 03:45:14,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 360 flow [2023-08-27 03:45:14,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:45:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:45:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 644 transitions. [2023-08-27 03:45:14,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4086294416243655 [2023-08-27 03:45:14,660 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 644 transitions. [2023-08-27 03:45:14,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 644 transitions. [2023-08-27 03:45:14,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:14,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 644 transitions. [2023-08-27 03:45:14,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 80.5) internal successors, (644), 8 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,664 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 197.0) internal successors, (1773), 9 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,665 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 98 flow. Second operand 8 states and 644 transitions. [2023-08-27 03:45:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 360 flow [2023-08-27 03:45:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 332 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:14,666 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 155 flow [2023-08-27 03:45:14,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-27 03:45:14,667 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-27 03:45:14,667 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 155 flow [2023-08-27 03:45:14,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:14,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:14,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:45:14,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:14,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:14,669 INFO L85 PathProgramCache]: Analyzing trace with hash 246560052, now seen corresponding path program 2 times [2023-08-27 03:45:14,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:14,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265417158] [2023-08-27 03:45:14,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:14,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:45:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265417158] [2023-08-27 03:45:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265417158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797222624] [2023-08-27 03:45:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:14,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:14,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 197 [2023-08-27 03:45:14,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:14,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:14,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 197 [2023-08-27 03:45:14,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:15,004 INFO L124 PetriNetUnfolderBase]: 36/113 cut-off events. [2023-08-27 03:45:15,004 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-08-27 03:45:15,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 113 events. 36/113 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 353 event pairs, 7 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 419. Up to 50 conditions per place. [2023-08-27 03:45:15,005 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 19 selfloop transitions, 3 changer transitions 26/48 dead transitions. [2023-08-27 03:45:15,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 347 flow [2023-08-27 03:45:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 569 transitions. [2023-08-27 03:45:15,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4126178390137781 [2023-08-27 03:45:15,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 569 transitions. [2023-08-27 03:45:15,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 569 transitions. [2023-08-27 03:45:15,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:15,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 569 transitions. [2023-08-27 03:45:15,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,012 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 155 flow. Second operand 7 states and 569 transitions. [2023-08-27 03:45:15,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 347 flow [2023-08-27 03:45:15,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 327 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-27 03:45:15,014 INFO L231 Difference]: Finished difference. Result has 47 places, 20 transitions, 103 flow [2023-08-27 03:45:15,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=20} [2023-08-27 03:45:15,016 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-08-27 03:45:15,016 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 20 transitions, 103 flow [2023-08-27 03:45:15,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:15,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:15,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:45:15,017 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 03:45:15,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1969421080, now seen corresponding path program 3 times [2023-08-27 03:45:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369751637] [2023-08-27 03:45:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:15,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:45:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:15,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:45:15,174 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:45:15,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 03:45:15,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (11 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 03:45:15,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (4 of 13 remaining) [2023-08-27 03:45:15,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 03:45:15,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2023-08-27 03:45:15,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 03:45:15,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 03:45:15,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:45:15,179 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:15,185 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:45:15,185 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:45:15,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:45:15 BasicIcfg [2023-08-27 03:45:15,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:45:15,230 INFO L158 Benchmark]: Toolchain (without parser) took 8251.41ms. Allocated memory was 364.9MB in the beginning and 480.2MB in the end (delta: 115.3MB). Free memory was 339.8MB in the beginning and 274.7MB in the end (delta: 65.1MB). Peak memory consumption was 182.0MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,231 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 364.9MB. Free memory is still 340.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:45:15,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.06ms. Allocated memory is still 364.9MB. Free memory was 339.8MB in the beginning and 316.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.01ms. Allocated memory is still 364.9MB. Free memory was 316.8MB in the beginning and 314.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,232 INFO L158 Benchmark]: Boogie Preprocessor took 57.68ms. Allocated memory is still 364.9MB. Free memory was 314.7MB in the beginning and 312.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,232 INFO L158 Benchmark]: RCFGBuilder took 701.77ms. Allocated memory is still 364.9MB. Free memory was 312.6MB in the beginning and 328.3MB in the end (delta: -15.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,232 INFO L158 Benchmark]: TraceAbstraction took 6836.05ms. Allocated memory was 364.9MB in the beginning and 480.2MB in the end (delta: 115.3MB). Free memory was 328.1MB in the beginning and 274.7MB in the end (delta: 53.4MB). Peak memory consumption was 171.9MB. Max. memory is 16.0GB. [2023-08-27 03:45:15,234 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.16ms. Allocated memory is still 364.9MB. Free memory is still 340.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 577.06ms. Allocated memory is still 364.9MB. Free memory was 339.8MB in the beginning and 316.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.01ms. Allocated memory is still 364.9MB. Free memory was 316.8MB in the beginning and 314.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.68ms. Allocated memory is still 364.9MB. Free memory was 314.7MB in the beginning and 312.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 701.77ms. Allocated memory is still 364.9MB. Free memory was 312.6MB in the beginning and 328.3MB in the end (delta: -15.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 6836.05ms. Allocated memory was 364.9MB in the beginning and 480.2MB in the end (delta: 115.3MB). Free memory was 328.1MB in the beginning and 274.7MB in the end (delta: 53.4MB). Peak memory consumption was 171.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 106 PlacesBefore, 32 PlacesAfterwards, 102 TransitionsBefore, 26 TransitionsAfterwards, 1858 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 6429 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2729, independent: 2496, independent conditional: 0, independent unconditional: 2496, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1059, independent: 1023, independent conditional: 0, independent unconditional: 1023, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2729, independent: 1473, independent conditional: 0, independent unconditional: 1473, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 1059, unknown conditional: 0, unknown unconditional: 1059] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L827] 0 pthread_t t833; [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-1, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L829] 0 pthread_t t834; [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L812] EXPR 2 __unbuffered_cnt + 1 [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] EXPR 1 __unbuffered_cnt + 1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L845] 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", "mix031.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 828]: 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, 129 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.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 647 IncrementalHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 25 mSDtfsCounter, 647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:45:15,251 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...