/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:08:31,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:08:31,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:08:31,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:08:31,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:08:31,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:08:31,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:08:31,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:08:31,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:08:31,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:08:31,183 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:08:31,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:08:31,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:08:31,184 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:08:31,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:08:31,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:08:31,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:08:31,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:08:31,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:08:31,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:08:31,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:08:31,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:08:31,187 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:08:31,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:08:31,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:08:31,188 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:08:31,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:08:31,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:08:31,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:08:31,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:08:31,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:08:31,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:08:31,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:08:31,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:08:31,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:08:31,191 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:08:31,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:08:31,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:08:31,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:08:31,551 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:08:31,551 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:08:31,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-08-26 21:08:32,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:08:33,061 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:08:33,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.opt.i [2023-08-26 21:08:33,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be671fd5e/fc03863ff0c843ffa3725e45a3f275a3/FLAG384ca0550 [2023-08-26 21:08:33,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be671fd5e/fc03863ff0c843ffa3725e45a3f275a3 [2023-08-26 21:08:33,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:08:33,110 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:08:33,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:08:33,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:08:33,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:08:33,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682f5b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33, skipping insertion in model container [2023-08-26 21:08:33,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:08:33,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:08:33,574 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:08:33,591 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:08:33,592 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:08:33,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:08:33,660 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:08:33,660 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:08:33,666 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:08:33,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33 WrapperNode [2023-08-26 21:08:33,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:08:33,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:08:33,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:08:33,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:08:33,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,731 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-08-26 21:08:33,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:08:33,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:08:33,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:08:33,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:08:33,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:08:33,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:08:33,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:08:33,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:08:33,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (1/1) ... [2023-08-26 21:08:33,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:08:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:08:33,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:08:33,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:08:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:08:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:08:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:08:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:08:33,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:08:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:08:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:08:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:08:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:08:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:08:33,829 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:08:33,944 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:08:33,945 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:08:34,230 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:08:34,412 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:08:34,413 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:08:34,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:08:34 BoogieIcfgContainer [2023-08-26 21:08:34,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:08:34,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:08:34,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:08:34,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:08:34,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:08:33" (1/3) ... [2023-08-26 21:08:34,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d5e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:08:34, skipping insertion in model container [2023-08-26 21:08:34,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:08:33" (2/3) ... [2023-08-26 21:08:34,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d5e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:08:34, skipping insertion in model container [2023-08-26 21:08:34,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:08:34" (3/3) ... [2023-08-26 21:08:34,424 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.opt.i [2023-08-26 21:08:34,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:08:34,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:08:34,440 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:08:34,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:08:34,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 265 flow [2023-08-26 21:08:34,696 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-08-26 21:08:34,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:08:34,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-26 21:08:34,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 125 transitions, 265 flow [2023-08-26 21:08:34,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 122 transitions, 253 flow [2023-08-26 21:08:34,714 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:08:34,724 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 122 transitions, 253 flow [2023-08-26 21:08:34,726 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 122 transitions, 253 flow [2023-08-26 21:08:34,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 253 flow [2023-08-26 21:08:34,769 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-08-26 21:08:34,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:08:34,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-26 21:08:34,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 2984 [2023-08-26 21:08:38,679 INFO L134 LiptonReduction]: Checked pairs total: 10724 [2023-08-26 21:08:38,679 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-26 21:08:38,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:08:38,697 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;@7fcf41b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:08:38,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:08:38,700 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:08:38,700 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-26 21:08:38,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:08:38,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:38,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:08:38,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:38,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 135106676, now seen corresponding path program 1 times [2023-08-26 21:08:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:38,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142982049] [2023-08-26 21:08:38,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:38,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:38,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142982049] [2023-08-26 21:08:38,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142982049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:38,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:38,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759142262] [2023-08-26 21:08:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:38,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:38,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:38,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:38,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-26 21:08:38,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:38,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-26 21:08:38,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:39,427 INFO L124 PetriNetUnfolderBase]: 2064/3057 cut-off events. [2023-08-26 21:08:39,427 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-26 21:08:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6124 conditions, 3057 events. 2064/3057 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15583 event pairs, 2064 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 6113. Up to 3000 conditions per place. [2023-08-26 21:08:39,453 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 23 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 21:08:39,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 111 flow [2023-08-26 21:08:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 21:08:39,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616457461645746 [2023-08-26 21:08:39,465 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 21:08:39,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 21:08:39,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:39,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 21:08:39,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,479 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 331 transitions. [2023-08-26 21:08:39,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 111 flow [2023-08-26 21:08:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:08:39,483 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 62 flow [2023-08-26 21:08:39,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-08-26 21:08:39,487 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-26 21:08:39,488 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 62 flow [2023-08-26 21:08:39,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:39,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:08:39,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:08:39,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:39,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash 135106677, now seen corresponding path program 1 times [2023-08-26 21:08:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:39,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052627114] [2023-08-26 21:08:39,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:39,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:39,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052627114] [2023-08-26 21:08:39,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052627114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:39,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:39,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487087581] [2023-08-26 21:08:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:39,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:39,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-26 21:08:39,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:39,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-26 21:08:39,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:39,880 INFO L124 PetriNetUnfolderBase]: 1320/2020 cut-off events. [2023-08-26 21:08:39,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:08:39,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 2020 events. 1320/2020 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9757 event pairs, 499 based on Foata normal form. 0/1625 useless extension candidates. Maximal degree in co-relation 4049. Up to 1272 conditions per place. [2023-08-26 21:08:39,894 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-26 21:08:39,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 190 flow [2023-08-26 21:08:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-26 21:08:39,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48675034867503486 [2023-08-26 21:08:39,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-26 21:08:39,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-26 21:08:39,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:39,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-26 21:08:39,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,907 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 62 flow. Second operand 3 states and 349 transitions. [2023-08-26 21:08:39,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 190 flow [2023-08-26 21:08:39,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:08:39,909 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 91 flow [2023-08-26 21:08:39,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-26 21:08:39,910 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-26 21:08:39,911 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 91 flow [2023-08-26 21:08:39,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:39,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:39,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:39,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:08:39,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:39,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -55939398, now seen corresponding path program 1 times [2023-08-26 21:08:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:39,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120311371] [2023-08-26 21:08:39,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120311371] [2023-08-26 21:08:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120311371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:40,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133627877] [2023-08-26 21:08:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:40,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:40,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 239 [2023-08-26 21:08:40,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:40,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 239 [2023-08-26 21:08:40,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:40,353 INFO L124 PetriNetUnfolderBase]: 1118/1793 cut-off events. [2023-08-26 21:08:40,354 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2023-08-26 21:08:40,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4194 conditions, 1793 events. 1118/1793 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9240 event pairs, 169 based on Foata normal form. 0/1533 useless extension candidates. Maximal degree in co-relation 4186. Up to 1388 conditions per place. [2023-08-26 21:08:40,365 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 38 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-26 21:08:40,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 211 flow [2023-08-26 21:08:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-26 21:08:40,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895397489539749 [2023-08-26 21:08:40,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-26 21:08:40,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-26 21:08:40,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:40,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-26 21:08:40,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,371 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 91 flow. Second operand 3 states and 351 transitions. [2023-08-26 21:08:40,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 211 flow [2023-08-26 21:08:40,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:08:40,373 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 89 flow [2023-08-26 21:08:40,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 21:08:40,374 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-26 21:08:40,374 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 89 flow [2023-08-26 21:08:40,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:40,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:40,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:08:40,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:40,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2076876656, now seen corresponding path program 1 times [2023-08-26 21:08:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038096671] [2023-08-26 21:08:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038096671] [2023-08-26 21:08:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038096671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983790664] [2023-08-26 21:08:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:40,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:40,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 21:08:40,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:40,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 21:08:40,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:40,973 INFO L124 PetriNetUnfolderBase]: 2245/3386 cut-off events. [2023-08-26 21:08:40,973 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2023-08-26 21:08:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7781 conditions, 3386 events. 2245/3386 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16076 event pairs, 878 based on Foata normal form. 0/2998 useless extension candidates. Maximal degree in co-relation 7772. Up to 2885 conditions per place. [2023-08-26 21:08:40,994 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-26 21:08:40,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 275 flow [2023-08-26 21:08:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-26 21:08:40,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46722454672245467 [2023-08-26 21:08:40,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-26 21:08:40,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-26 21:08:40,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:40,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-26 21:08:40,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:40,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,000 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 89 flow. Second operand 3 states and 335 transitions. [2023-08-26 21:08:41,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 275 flow [2023-08-26 21:08:41,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:41,003 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 147 flow [2023-08-26 21:08:41,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-08-26 21:08:41,005 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-26 21:08:41,005 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 147 flow [2023-08-26 21:08:41,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:41,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:08:41,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:41,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -79455092, now seen corresponding path program 1 times [2023-08-26 21:08:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119721451] [2023-08-26 21:08:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:41,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:41,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119721451] [2023-08-26 21:08:41,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119721451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:41,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:41,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:08:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643052684] [2023-08-26 21:08:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:41,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:08:41,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:41,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:08:41,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:08:41,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 21:08:41,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:41,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 21:08:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:41,613 INFO L124 PetriNetUnfolderBase]: 2131/3226 cut-off events. [2023-08-26 21:08:41,613 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2023-08-26 21:08:41,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9054 conditions, 3226 events. 2131/3226 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15152 event pairs, 566 based on Foata normal form. 46/3062 useless extension candidates. Maximal degree in co-relation 9043. Up to 2071 conditions per place. [2023-08-26 21:08:41,637 INFO L140 encePairwiseOnDemand]: 230/239 looper letters, 58 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2023-08-26 21:08:41,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 401 flow [2023-08-26 21:08:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:08:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:08:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-26 21:08:41,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45397489539748953 [2023-08-26 21:08:41,639 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-26 21:08:41,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-26 21:08:41,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:41,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-26 21:08:41,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,644 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 147 flow. Second operand 4 states and 434 transitions. [2023-08-26 21:08:41,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 401 flow [2023-08-26 21:08:41,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:41,657 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 199 flow [2023-08-26 21:08:41,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-26 21:08:41,658 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-26 21:08:41,658 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 199 flow [2023-08-26 21:08:41,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:41,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:41,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:08:41,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:41,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1283016143, now seen corresponding path program 1 times [2023-08-26 21:08:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483838498] [2023-08-26 21:08:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483838498] [2023-08-26 21:08:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483838498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:41,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567524526] [2023-08-26 21:08:41,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:41,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:41,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:41,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 21:08:41,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:41,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:41,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 21:08:41,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:42,148 INFO L124 PetriNetUnfolderBase]: 1655/2683 cut-off events. [2023-08-26 21:08:42,148 INFO L125 PetriNetUnfolderBase]: For 2313/2338 co-relation queries the response was YES. [2023-08-26 21:08:42,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 2683 events. 1655/2683 cut-off events. For 2313/2338 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13896 event pairs, 849 based on Foata normal form. 54/2510 useless extension candidates. Maximal degree in co-relation 7777. Up to 1633 conditions per place. [2023-08-26 21:08:42,176 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 51 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-26 21:08:42,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 403 flow [2023-08-26 21:08:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-26 21:08:42,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48675034867503486 [2023-08-26 21:08:42,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-26 21:08:42,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-26 21:08:42,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:42,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-26 21:08:42,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,183 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 199 flow. Second operand 3 states and 349 transitions. [2023-08-26 21:08:42,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 403 flow [2023-08-26 21:08:42,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:08:42,191 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 210 flow [2023-08-26 21:08:42,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 21:08:42,194 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 21:08:42,196 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 210 flow [2023-08-26 21:08:42,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:42,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:08:42,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:42,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1155956384, now seen corresponding path program 1 times [2023-08-26 21:08:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143022193] [2023-08-26 21:08:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:42,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143022193] [2023-08-26 21:08:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143022193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:42,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:08:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682852658] [2023-08-26 21:08:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:08:42,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:08:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:08:42,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-26 21:08:42,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:42,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-26 21:08:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:42,595 INFO L124 PetriNetUnfolderBase]: 1402/2236 cut-off events. [2023-08-26 21:08:42,595 INFO L125 PetriNetUnfolderBase]: For 2247/2282 co-relation queries the response was YES. [2023-08-26 21:08:42,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6914 conditions, 2236 events. 1402/2236 cut-off events. For 2247/2282 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11398 event pairs, 466 based on Foata normal form. 10/2176 useless extension candidates. Maximal degree in co-relation 6898. Up to 853 conditions per place. [2023-08-26 21:08:42,607 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 67 selfloop transitions, 7 changer transitions 0/82 dead transitions. [2023-08-26 21:08:42,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 559 flow [2023-08-26 21:08:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:08:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:08:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-26 21:08:42,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48535564853556484 [2023-08-26 21:08:42,610 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-26 21:08:42,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-26 21:08:42,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:42,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-26 21:08:42,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,613 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,613 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 210 flow. Second operand 4 states and 464 transitions. [2023-08-26 21:08:42,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 559 flow [2023-08-26 21:08:42,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:42,618 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 246 flow [2023-08-26 21:08:42,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-26 21:08:42,619 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-26 21:08:42,619 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 246 flow [2023-08-26 21:08:42,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:42,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:42,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:08:42,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:42,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1614540423, now seen corresponding path program 1 times [2023-08-26 21:08:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725971224] [2023-08-26 21:08:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:42,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725971224] [2023-08-26 21:08:42,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725971224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:42,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:42,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:08:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032342649] [2023-08-26 21:08:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:08:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:08:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:08:42,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 239 [2023-08-26 21:08:42,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:42,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:42,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 239 [2023-08-26 21:08:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:43,039 INFO L124 PetriNetUnfolderBase]: 1469/2304 cut-off events. [2023-08-26 21:08:43,039 INFO L125 PetriNetUnfolderBase]: For 3100/3100 co-relation queries the response was YES. [2023-08-26 21:08:43,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 2304 events. 1469/2304 cut-off events. For 3100/3100 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11147 event pairs, 577 based on Foata normal form. 22/2263 useless extension candidates. Maximal degree in co-relation 7542. Up to 1421 conditions per place. [2023-08-26 21:08:43,054 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 53 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-26 21:08:43,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 453 flow [2023-08-26 21:08:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:08:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:08:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-26 21:08:43,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825662482566248 [2023-08-26 21:08:43,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-26 21:08:43,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-26 21:08:43,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:43,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-26 21:08:43,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,059 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 246 flow. Second operand 3 states and 346 transitions. [2023-08-26 21:08:43,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 453 flow [2023-08-26 21:08:43,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 431 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:43,065 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 246 flow [2023-08-26 21:08:43,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 21:08:43,066 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-26 21:08:43,066 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 246 flow [2023-08-26 21:08:43,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:43,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:43,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:08:43,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:43,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1348266759, now seen corresponding path program 1 times [2023-08-26 21:08:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:43,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949139850] [2023-08-26 21:08:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949139850] [2023-08-26 21:08:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949139850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:43,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:43,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:08:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138880357] [2023-08-26 21:08:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:43,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:08:43,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:08:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:08:43,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-26 21:08:43,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:43,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-26 21:08:43,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:43,607 INFO L124 PetriNetUnfolderBase]: 871/1499 cut-off events. [2023-08-26 21:08:43,608 INFO L125 PetriNetUnfolderBase]: For 1373/1402 co-relation queries the response was YES. [2023-08-26 21:08:43,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 1499 events. 871/1499 cut-off events. For 1373/1402 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7721 event pairs, 180 based on Foata normal form. 135/1558 useless extension candidates. Maximal degree in co-relation 4678. Up to 854 conditions per place. [2023-08-26 21:08:43,617 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 66 selfloop transitions, 8 changer transitions 3/85 dead transitions. [2023-08-26 21:08:43,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 85 transitions, 576 flow [2023-08-26 21:08:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:08:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:08:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-26 21:08:43,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46694560669456064 [2023-08-26 21:08:43,619 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-26 21:08:43,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-26 21:08:43,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:43,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-26 21:08:43,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,624 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,624 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 246 flow. Second operand 5 states and 558 transitions. [2023-08-26 21:08:43,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 85 transitions, 576 flow [2023-08-26 21:08:43,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:43,628 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 288 flow [2023-08-26 21:08:43,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-26 21:08:43,629 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-26 21:08:43,629 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 288 flow [2023-08-26 21:08:43,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:43,630 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-26 21:08:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:08:43,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:43,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1690830920, now seen corresponding path program 1 times [2023-08-26 21:08:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338126302] [2023-08-26 21:08:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:43,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338126302] [2023-08-26 21:08:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338126302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:43,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:08:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628914988] [2023-08-26 21:08:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:08:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:08:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:08:43,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 21:08:43,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:43,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:43,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 21:08:43,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:44,200 INFO L124 PetriNetUnfolderBase]: 1421/2340 cut-off events. [2023-08-26 21:08:44,201 INFO L125 PetriNetUnfolderBase]: For 3230/3230 co-relation queries the response was YES. [2023-08-26 21:08:44,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8253 conditions, 2340 events. 1421/2340 cut-off events. For 3230/3230 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11999 event pairs, 255 based on Foata normal form. 22/2323 useless extension candidates. Maximal degree in co-relation 8232. Up to 1471 conditions per place. [2023-08-26 21:08:44,216 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 87 selfloop transitions, 26 changer transitions 0/113 dead transitions. [2023-08-26 21:08:44,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 113 transitions, 860 flow [2023-08-26 21:08:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:08:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:08:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-26 21:08:44,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45439330543933054 [2023-08-26 21:08:44,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-26 21:08:44,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-26 21:08:44,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:44,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-26 21:08:44,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,223 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 288 flow. Second operand 5 states and 543 transitions. [2023-08-26 21:08:44,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 113 transitions, 860 flow [2023-08-26 21:08:44,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:08:44,231 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 473 flow [2023-08-26 21:08:44,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-08-26 21:08:44,232 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-26 21:08:44,232 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 473 flow [2023-08-26 21:08:44,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:44,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:44,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:08:44,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:44,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2065200405, now seen corresponding path program 1 times [2023-08-26 21:08:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388900154] [2023-08-26 21:08:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388900154] [2023-08-26 21:08:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388900154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:08:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760587892] [2023-08-26 21:08:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:44,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:08:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:08:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:08:44,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 239 [2023-08-26 21:08:44,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 473 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:44,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 239 [2023-08-26 21:08:44,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:44,950 INFO L124 PetriNetUnfolderBase]: 1893/3203 cut-off events. [2023-08-26 21:08:44,950 INFO L125 PetriNetUnfolderBase]: For 6756/6756 co-relation queries the response was YES. [2023-08-26 21:08:44,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13050 conditions, 3203 events. 1893/3203 cut-off events. For 6756/6756 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18394 event pairs, 254 based on Foata normal form. 21/3147 useless extension candidates. Maximal degree in co-relation 13026. Up to 1715 conditions per place. [2023-08-26 21:08:44,971 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 116 selfloop transitions, 35 changer transitions 3/154 dead transitions. [2023-08-26 21:08:44,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 154 transitions, 1381 flow [2023-08-26 21:08:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:08:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:08:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-26 21:08:44,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525801952580195 [2023-08-26 21:08:44,974 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-26 21:08:44,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-26 21:08:44,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:44,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-26 21:08:44,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,979 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:44,979 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 473 flow. Second operand 6 states and 649 transitions. [2023-08-26 21:08:44,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 154 transitions, 1381 flow [2023-08-26 21:08:44,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 154 transitions, 1381 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:08:44,999 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 838 flow [2023-08-26 21:08:45,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=838, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-08-26 21:08:45,000 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-26 21:08:45,000 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 838 flow [2023-08-26 21:08:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:45,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:45,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:08:45,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:45,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1309179567, now seen corresponding path program 2 times [2023-08-26 21:08:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865488469] [2023-08-26 21:08:45,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:45,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865488469] [2023-08-26 21:08:45,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865488469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:45,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:45,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:08:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095512062] [2023-08-26 21:08:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:45,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:08:45,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:45,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:08:45,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:08:45,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-26 21:08:45,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 838 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:45,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-26 21:08:45,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:45,604 INFO L124 PetriNetUnfolderBase]: 1079/1969 cut-off events. [2023-08-26 21:08:45,604 INFO L125 PetriNetUnfolderBase]: For 4971/5235 co-relation queries the response was YES. [2023-08-26 21:08:45,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1969 events. 1079/1969 cut-off events. For 4971/5235 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11961 event pairs, 124 based on Foata normal form. 212/2048 useless extension candidates. Maximal degree in co-relation 7871. Up to 571 conditions per place. [2023-08-26 21:08:45,618 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 109 selfloop transitions, 15 changer transitions 3/142 dead transitions. [2023-08-26 21:08:45,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 142 transitions, 1358 flow [2023-08-26 21:08:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:08:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:08:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2023-08-26 21:08:45,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656306037059175 [2023-08-26 21:08:45,621 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2023-08-26 21:08:45,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2023-08-26 21:08:45,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:45,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2023-08-26 21:08:45,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,627 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,627 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 838 flow. Second operand 7 states and 779 transitions. [2023-08-26 21:08:45,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 142 transitions, 1358 flow [2023-08-26 21:08:45,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 142 transitions, 1344 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 21:08:45,644 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 719 flow [2023-08-26 21:08:45,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=719, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-08-26 21:08:45,644 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-08-26 21:08:45,644 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 719 flow [2023-08-26 21:08:45,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:45,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:45,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:08:45,645 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:45,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1749773913, now seen corresponding path program 1 times [2023-08-26 21:08:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364402511] [2023-08-26 21:08:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364402511] [2023-08-26 21:08:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364402511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:45,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:08:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222851424] [2023-08-26 21:08:45,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:45,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:08:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:08:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:08:45,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-26 21:08:45,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 719 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:45,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:45,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-26 21:08:45,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:46,052 INFO L124 PetriNetUnfolderBase]: 1035/1871 cut-off events. [2023-08-26 21:08:46,052 INFO L125 PetriNetUnfolderBase]: For 6479/6694 co-relation queries the response was YES. [2023-08-26 21:08:46,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8492 conditions, 1871 events. 1035/1871 cut-off events. For 6479/6694 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11153 event pairs, 203 based on Foata normal form. 38/1843 useless extension candidates. Maximal degree in co-relation 8459. Up to 690 conditions per place. [2023-08-26 21:08:46,063 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 54 selfloop transitions, 13 changer transitions 28/105 dead transitions. [2023-08-26 21:08:46,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 1112 flow [2023-08-26 21:08:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:08:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:08:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2023-08-26 21:08:46,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4686192468619247 [2023-08-26 21:08:46,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 560 transitions. [2023-08-26 21:08:46,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 560 transitions. [2023-08-26 21:08:46,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:46,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 560 transitions. [2023-08-26 21:08:46,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,070 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,070 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 719 flow. Second operand 5 states and 560 transitions. [2023-08-26 21:08:46,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 1112 flow [2023-08-26 21:08:46,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 1085 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:08:46,092 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 418 flow [2023-08-26 21:08:46,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2023-08-26 21:08:46,093 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-26 21:08:46,093 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 418 flow [2023-08-26 21:08:46,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:46,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:46,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:08:46,094 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:46,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1680251192, now seen corresponding path program 1 times [2023-08-26 21:08:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313950382] [2023-08-26 21:08:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:46,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:46,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:46,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313950382] [2023-08-26 21:08:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313950382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:46,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:08:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087297400] [2023-08-26 21:08:46,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:46,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:08:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:08:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:08:46,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 239 [2023-08-26 21:08:46,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:46,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 239 [2023-08-26 21:08:46,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:46,596 INFO L124 PetriNetUnfolderBase]: 779/1376 cut-off events. [2023-08-26 21:08:46,597 INFO L125 PetriNetUnfolderBase]: For 3872/4035 co-relation queries the response was YES. [2023-08-26 21:08:46,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5837 conditions, 1376 events. 779/1376 cut-off events. For 3872/4035 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7744 event pairs, 80 based on Foata normal form. 79/1410 useless extension candidates. Maximal degree in co-relation 5804. Up to 462 conditions per place. [2023-08-26 21:08:46,604 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 55 selfloop transitions, 15 changer transitions 37/113 dead transitions. [2023-08-26 21:08:46,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 1017 flow [2023-08-26 21:08:46,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:08:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:08:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 968 transitions. [2023-08-26 21:08:46,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4500232450023245 [2023-08-26 21:08:46,607 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 968 transitions. [2023-08-26 21:08:46,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 968 transitions. [2023-08-26 21:08:46,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:46,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 968 transitions. [2023-08-26 21:08:46,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,615 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,615 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 418 flow. Second operand 9 states and 968 transitions. [2023-08-26 21:08:46,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 1017 flow [2023-08-26 21:08:46,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 113 transitions, 846 flow, removed 23 selfloop flow, removed 14 redundant places. [2023-08-26 21:08:46,627 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 288 flow [2023-08-26 21:08:46,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=288, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2023-08-26 21:08:46,628 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-26 21:08:46,628 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 288 flow [2023-08-26 21:08:46,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:46,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:08:46,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:46,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2059592396, now seen corresponding path program 1 times [2023-08-26 21:08:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402227924] [2023-08-26 21:08:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:46,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402227924] [2023-08-26 21:08:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402227924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:46,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:08:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724787533] [2023-08-26 21:08:46,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:46,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:08:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:08:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:08:46,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 239 [2023-08-26 21:08:46,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:46,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:46,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 239 [2023-08-26 21:08:46,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:47,034 INFO L124 PetriNetUnfolderBase]: 587/1139 cut-off events. [2023-08-26 21:08:47,035 INFO L125 PetriNetUnfolderBase]: For 2937/2997 co-relation queries the response was YES. [2023-08-26 21:08:47,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 1139 events. 587/1139 cut-off events. For 2937/2997 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6414 event pairs, 175 based on Foata normal form. 10/1129 useless extension candidates. Maximal degree in co-relation 4628. Up to 507 conditions per place. [2023-08-26 21:08:47,039 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 27 selfloop transitions, 1 changer transitions 48/78 dead transitions. [2023-08-26 21:08:47,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 682 flow [2023-08-26 21:08:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:08:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:08:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-26 21:08:47,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675732217573222 [2023-08-26 21:08:47,041 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-26 21:08:47,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-26 21:08:47,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:47,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-26 21:08:47,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:47,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:47,044 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 239.0) internal successors, (1195), 5 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:47,044 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 288 flow. Second operand 4 states and 447 transitions. [2023-08-26 21:08:47,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 682 flow [2023-08-26 21:08:47,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 590 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-26 21:08:47,052 INFO L231 Difference]: Finished difference. Result has 59 places, 28 transitions, 151 flow [2023-08-26 21:08:47,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=59, PETRI_TRANSITIONS=28} [2023-08-26 21:08:47,053 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-26 21:08:47,053 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 28 transitions, 151 flow [2023-08-26 21:08:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:47,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:47,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:47,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:08:47,054 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:47,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -617443452, now seen corresponding path program 2 times [2023-08-26 21:08:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004396258] [2023-08-26 21:08:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:08:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:08:47,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:08:47,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004396258] [2023-08-26 21:08:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004396258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:08:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:08:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:08:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831919493] [2023-08-26 21:08:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:08:47,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:08:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:08:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:08:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:08:47,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 239 [2023-08-26 21:08:47,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 28 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:47,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:08:47,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 239 [2023-08-26 21:08:47,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:08:48,104 INFO L124 PetriNetUnfolderBase]: 93/215 cut-off events. [2023-08-26 21:08:48,104 INFO L125 PetriNetUnfolderBase]: For 429/448 co-relation queries the response was YES. [2023-08-26 21:08:48,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 215 events. 93/215 cut-off events. For 429/448 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 836 event pairs, 16 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 778. Up to 78 conditions per place. [2023-08-26 21:08:48,105 INFO L140 encePairwiseOnDemand]: 232/239 looper letters, 22 selfloop transitions, 4 changer transitions 24/53 dead transitions. [2023-08-26 21:08:48,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 397 flow [2023-08-26 21:08:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:08:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:08:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 797 transitions. [2023-08-26 21:08:48,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4168410041841004 [2023-08-26 21:08:48,108 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 797 transitions. [2023-08-26 21:08:48,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 797 transitions. [2023-08-26 21:08:48,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:08:48,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 797 transitions. [2023-08-26 21:08:48,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.625) internal successors, (797), 8 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:48,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:48,114 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 239.0) internal successors, (2151), 9 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:48,114 INFO L175 Difference]: Start difference. First operand has 59 places, 28 transitions, 151 flow. Second operand 8 states and 797 transitions. [2023-08-26 21:08:48,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 397 flow [2023-08-26 21:08:48,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 373 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-26 21:08:48,116 INFO L231 Difference]: Finished difference. Result has 55 places, 28 transitions, 152 flow [2023-08-26 21:08:48,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=28} [2023-08-26 21:08:48,117 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-26 21:08:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 28 transitions, 152 flow [2023-08-26 21:08:48,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:08:48,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:08:48,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:08:48,118 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:08:48,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:08:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1788345186, now seen corresponding path program 3 times [2023-08-26 21:08:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:08:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389722672] [2023-08-26 21:08:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:08:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:08:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:08:48,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:08:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:08:48,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:08:48,212 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:08:48,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (12 of 18 remaining) [2023-08-26 21:08:48,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:08:48,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (2 of 18 remaining) [2023-08-26 21:08:48,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:08:48,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:08:48,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:08:48,217 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:08:48,222 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:08:48,222 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:08:48,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:08:48 BasicIcfg [2023-08-26 21:08:48,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:08:48,276 INFO L158 Benchmark]: Toolchain (without parser) took 15166.72ms. Allocated memory was 360.7MB in the beginning and 784.3MB in the end (delta: 423.6MB). Free memory was 335.7MB in the beginning and 340.4MB in the end (delta: -4.7MB). Peak memory consumption was 420.7MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,277 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory was 338.9MB in the beginning and 338.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:08:48,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.22ms. Allocated memory is still 360.7MB. Free memory was 335.7MB in the beginning and 311.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.42ms. Allocated memory is still 360.7MB. Free memory was 311.9MB in the beginning and 309.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,277 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 360.7MB. Free memory was 309.1MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,277 INFO L158 Benchmark]: RCFGBuilder took 650.17ms. Allocated memory is still 360.7MB. Free memory was 306.4MB in the beginning and 265.1MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,278 INFO L158 Benchmark]: TraceAbstraction took 13858.44ms. Allocated memory was 360.7MB in the beginning and 784.3MB in the end (delta: 423.6MB). Free memory was 264.4MB in the beginning and 340.4MB in the end (delta: -76.0MB). Peak memory consumption was 349.4MB. Max. memory is 16.0GB. [2023-08-26 21:08:48,279 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 360.7MB. Free memory was 338.9MB in the beginning and 338.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 553.22ms. Allocated memory is still 360.7MB. Free memory was 335.7MB in the beginning and 311.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.42ms. Allocated memory is still 360.7MB. Free memory was 311.9MB in the beginning and 309.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 360.7MB. Free memory was 309.1MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 650.17ms. Allocated memory is still 360.7MB. Free memory was 306.4MB in the beginning and 265.1MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 13858.44ms. Allocated memory was 360.7MB in the beginning and 784.3MB in the end (delta: 423.6MB). Free memory was 264.4MB in the beginning and 340.4MB in the end (delta: -76.0MB). Peak memory consumption was 349.4MB. 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: 4.0s, 129 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 31 TransitionsAfterwards, 2984 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, 10724 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5379, independent: 5083, independent conditional: 0, independent unconditional: 5083, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1725, independent: 1675, independent conditional: 0, independent unconditional: 1675, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5379, independent: 3408, independent conditional: 0, independent unconditional: 3408, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 1725, unknown conditional: 0, unknown unconditional: 1725] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41; [L859] FCALL, FORK 0 pthread_create(&t41, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41, ((void *)0), P0, ((void *)0))=-2, t41={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t42; [L861] FCALL, FORK 0 pthread_create(&t42, ((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, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42, ((void *)0), P1, ((void *)0))=-1, t41={5:0}, t42={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t43; [L863] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43, ((void *)0), P2, ((void *)0))=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 z$w_buff1 = z$w_buff0 [L806] 3 z$w_buff0 = 1 [L807] 3 z$w_buff1_used = z$w_buff0_used [L808] 3 z$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 z$flush_delayed = weak$$choice2 [L820] 3 z$mem_tmp = z [L821] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L822] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L823] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L824] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L825] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L827] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EAX = z [L829] 3 z = z$flush_delayed ? z$mem_tmp : z [L830] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 x = 1 [L759] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L781] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L782] 2 z$flush_delayed = weak$$choice2 [L783] 2 z$mem_tmp = z [L784] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L785] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L786] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L787] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L788] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L790] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 __unbuffered_p1_EBX = z [L792] 2 z = z$flush_delayed ? z$mem_tmp : z [L793] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] EXPR 2 __unbuffered_cnt + 1 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L836] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L837] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L838] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L839] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] EXPR 3 __unbuffered_cnt + 1 [L843] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 3 return 0; [L767] EXPR 1 __unbuffered_cnt + 1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t41={5:0}, t42={6:0}, t43={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L878] 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", "mix002.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 798]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1213 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 20 mSDtfsCounter, 1213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=838occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:08:48,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...