./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:45:38,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:45:38,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:45:38,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:45:38,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:45:38,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:45:38,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:45:38,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:45:38,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:45:38,559 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:45:38,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:45:38,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:45:38,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:45:38,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:45:38,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:45:38,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:45:38,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:38,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:38,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:38,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:45:38,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:45:38,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:45:38,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 [2025-01-10 06:45:38,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:45:38,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:45:38,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:45:38,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:45:38,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:45:38,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-10 06:45:40,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44c5ecf42/2a7316a53fd14caba85e583367236ffc/FLAGc49cde9e2 [2025-01-10 06:45:40,428 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:45:40,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-10 06:45:40,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44c5ecf42/2a7316a53fd14caba85e583367236ffc/FLAGc49cde9e2 [2025-01-10 06:45:40,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44c5ecf42/2a7316a53fd14caba85e583367236ffc [2025-01-10 06:45:40,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:45:40,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:45:40,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:40,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:45:40,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:45:40,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:40" (1/1) ... [2025-01-10 06:45:40,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:40, skipping insertion in model container [2025-01-10 06:45:40,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:45:40" (1/1) ... [2025-01-10 06:45:40,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:45:40,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:41,014 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:45:41,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:45:41,127 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:45:41,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41 WrapperNode [2025-01-10 06:45:41,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:45:41,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:41,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:45:41,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:45:41,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,175 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-01-10 06:45:41,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:45:41,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:45:41,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:45:41,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:45:41,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,206 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-01-10 06:45:41,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:45:41,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:45:41,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:45:41,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:45:41,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (1/1) ... [2025-01-10 06:45:41,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:45:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:45:41,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:45:41,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:45:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:45:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:45:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:45:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:45:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:45:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:45:41,292 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:45:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:45:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:45:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:45:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:45:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:45:41,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:45:41,294 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:45:41,428 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:45:41,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:45:41,621 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:45:41,621 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:45:41,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:45:41,973 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:45:41,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:41 BoogieIcfgContainer [2025-01-10 06:45:41,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:45:41,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:45:41,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:45:41,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:45:41,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:45:40" (1/3) ... [2025-01-10 06:45:41,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b702b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:41, skipping insertion in model container [2025-01-10 06:45:41,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:45:41" (2/3) ... [2025-01-10 06:45:41,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b702b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:45:41, skipping insertion in model container [2025-01-10 06:45:41,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:45:41" (3/3) ... [2025-01-10 06:45:41,983 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-01-10 06:45:41,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:45:41,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 55 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:45:41,995 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:45:42,041 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:45:42,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 141 flow [2025-01-10 06:45:42,110 INFO L124 PetriNetUnfolderBase]: 17/89 cut-off events. [2025-01-10 06:45:42,112 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 89 events. 17/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 270 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2025-01-10 06:45:42,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 67 transitions, 141 flow [2025-01-10 06:45:42,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 66 transitions, 139 flow [2025-01-10 06:45:42,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:42,133 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@a6de7e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:42,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:45:42,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:42,145 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:42,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:42,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:42,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:42,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:42,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash 460280579, now seen corresponding path program 1 times [2025-01-10 06:45:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-01-10 06:45:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:42,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:42,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:42,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:42,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-01-10 06:45:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025031283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:42,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:42,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325488260] [2025-01-10 06:45:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:42,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:42,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 67 [2025-01-10 06:45:42,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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) [2025-01-10 06:45:42,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:42,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 67 [2025-01-10 06:45:42,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:42,707 INFO L124 PetriNetUnfolderBase]: 159/431 cut-off events. [2025-01-10 06:45:42,707 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:45:42,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 431 events. 159/431 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2159 event pairs, 20 based on Foata normal form. 72/444 useless extension candidates. Maximal degree in co-relation 709. Up to 264 conditions per place. [2025-01-10 06:45:42,711 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 47 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-01-10 06:45:42,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 265 flow [2025-01-10 06:45:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2025-01-10 06:45:42,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7052238805970149 [2025-01-10 06:45:42,721 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 139 flow. Second operand 4 states and 189 transitions. [2025-01-10 06:45:42,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 265 flow [2025-01-10 06:45:42,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:42,726 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 129 flow [2025-01-10 06:45:42,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-01-10 06:45:42,730 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-01-10 06:45:42,730 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 129 flow [2025-01-10 06:45:42,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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) [2025-01-10 06:45:42,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:42,731 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:45:42,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:45:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1611383572, now seen corresponding path program 1 times [2025-01-10 06:45:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716751759] [2025-01-10 06:45:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:42,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:42,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:42,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:42,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:45:42,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:45:42,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:42,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:42,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:42,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:45:42,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:45:42,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:45:42,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:45:42,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:45:42,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:45:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:45:42,842 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:45:42,845 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:42,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:45:42,869 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:45:42,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:42,890 INFO L124 PetriNetUnfolderBase]: 30/163 cut-off events. [2025-01-10 06:45:42,890 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:45:42,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 163 events. 30/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 601 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 98. Up to 9 conditions per place. [2025-01-10 06:45:42,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:42,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 100 transitions, 216 flow [2025-01-10 06:45:42,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:42,894 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@a6de7e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:42,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:45:42,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:42,897 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-01-10 06:45:42,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:42,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:42,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:42,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:42,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 555740870, now seen corresponding path program 1 times [2025-01-10 06:45:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715165728] [2025-01-10 06:45:42,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:42,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715165728] [2025-01-10 06:45:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715165728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891286703] [2025-01-10 06:45:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:42,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:42,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:42,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:42,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 100 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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) [2025-01-10 06:45:42,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:42,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:44,033 INFO L124 PetriNetUnfolderBase]: 4611/9735 cut-off events. [2025-01-10 06:45:44,033 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 06:45:44,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16808 conditions, 9735 events. 4611/9735 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 83177 event pairs, 1952 based on Foata normal form. 1699/10276 useless extension candidates. Maximal degree in co-relation 1345. Up to 6969 conditions per place. [2025-01-10 06:45:44,096 INFO L140 encePairwiseOnDemand]: 80/100 looper letters, 65 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-01-10 06:45:44,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 111 transitions, 374 flow [2025-01-10 06:45:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2025-01-10 06:45:44,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6725 [2025-01-10 06:45:44,098 INFO L175 Difference]: Start difference. First operand has 86 places, 100 transitions, 216 flow. Second operand 4 states and 269 transitions. [2025-01-10 06:45:44,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 111 transitions, 374 flow [2025-01-10 06:45:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:44,101 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 212 flow [2025-01-10 06:45:44,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-01-10 06:45:44,102 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 5 predicate places. [2025-01-10 06:45:44,102 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 212 flow [2025-01-10 06:45:44,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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) [2025-01-10 06:45:44,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:44,103 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:44,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:45:44,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1304614769, now seen corresponding path program 1 times [2025-01-10 06:45:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:44,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316012619] [2025-01-10 06:45:44,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:44,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:44,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:44,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:44,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316012619] [2025-01-10 06:45:44,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316012619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:44,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843903153] [2025-01-10 06:45:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:44,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:44,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:44,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:44,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:44,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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) [2025-01-10 06:45:44,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:44,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:44,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:45,124 INFO L124 PetriNetUnfolderBase]: 3957/8136 cut-off events. [2025-01-10 06:45:45,124 INFO L125 PetriNetUnfolderBase]: For 654/654 co-relation queries the response was YES. [2025-01-10 06:45:45,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14727 conditions, 8136 events. 3957/8136 cut-off events. For 654/654 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 66204 event pairs, 326 based on Foata normal form. 144/7349 useless extension candidates. Maximal degree in co-relation 3532. Up to 3893 conditions per place. [2025-01-10 06:45:45,170 INFO L140 encePairwiseOnDemand]: 95/100 looper letters, 105 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2025-01-10 06:45:45,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 154 transitions, 564 flow [2025-01-10 06:45:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:45:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:45:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-01-10 06:45:45,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 06:45:45,175 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 212 flow. Second operand 6 states and 370 transitions. [2025-01-10 06:45:45,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 154 transitions, 564 flow [2025-01-10 06:45:45,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:45,179 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 218 flow [2025-01-10 06:45:45,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-01-10 06:45:45,180 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2025-01-10 06:45:45,180 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 218 flow [2025-01-10 06:45:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 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) [2025-01-10 06:45:45,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:45,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:45,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:45:45,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 9577970, now seen corresponding path program 1 times [2025-01-10 06:45:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375066888] [2025-01-10 06:45:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:45,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:45,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:45,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375066888] [2025-01-10 06:45:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375066888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758363379] [2025-01-10 06:45:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:45,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:45,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:45,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 100 [2025-01-10 06:45:45,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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) [2025-01-10 06:45:45,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:45,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 100 [2025-01-10 06:45:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:46,321 INFO L124 PetriNetUnfolderBase]: 6320/12941 cut-off events. [2025-01-10 06:45:46,321 INFO L125 PetriNetUnfolderBase]: For 1175/1336 co-relation queries the response was YES. [2025-01-10 06:45:46,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23410 conditions, 12941 events. 6320/12941 cut-off events. For 1175/1336 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 112407 event pairs, 1495 based on Foata normal form. 222/11783 useless extension candidates. Maximal degree in co-relation 18886. Up to 6459 conditions per place. [2025-01-10 06:45:46,395 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 122 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2025-01-10 06:45:46,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 178 transitions, 722 flow [2025-01-10 06:45:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:45:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:45:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 355 transitions. [2025-01-10 06:45:46,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71 [2025-01-10 06:45:46,397 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 218 flow. Second operand 5 states and 355 transitions. [2025-01-10 06:45:46,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 178 transitions, 722 flow [2025-01-10 06:45:46,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 178 transitions, 699 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:45:46,401 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 300 flow [2025-01-10 06:45:46,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2025-01-10 06:45:46,402 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 12 predicate places. [2025-01-10 06:45:46,402 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 300 flow [2025-01-10 06:45:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 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) [2025-01-10 06:45:46,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:46,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:45:46,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:45:46,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1788352741, now seen corresponding path program 1 times [2025-01-10 06:45:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444872044] [2025-01-10 06:45:46,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:46,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:45:46,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:45:46,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:46,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444872044] [2025-01-10 06:45:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444872044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:46,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:45:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125764484] [2025-01-10 06:45:46,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:46,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:46,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:46,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:46,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 100 [2025-01-10 06:45:46,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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) [2025-01-10 06:45:46,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:46,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 100 [2025-01-10 06:45:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:47,169 INFO L124 PetriNetUnfolderBase]: 5333/11397 cut-off events. [2025-01-10 06:45:47,169 INFO L125 PetriNetUnfolderBase]: For 3629/3633 co-relation queries the response was YES. [2025-01-10 06:45:47,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22696 conditions, 11397 events. 5333/11397 cut-off events. For 3629/3633 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 99486 event pairs, 513 based on Foata normal form. 152/10318 useless extension candidates. Maximal degree in co-relation 19383. Up to 7054 conditions per place. [2025-01-10 06:45:47,213 INFO L140 encePairwiseOnDemand]: 95/100 looper letters, 103 selfloop transitions, 6 changer transitions 0/152 dead transitions. [2025-01-10 06:45:47,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 152 transitions, 688 flow [2025-01-10 06:45:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-01-10 06:45:47,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475 [2025-01-10 06:45:47,214 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 300 flow. Second operand 4 states and 259 transitions. [2025-01-10 06:45:47,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 152 transitions, 688 flow [2025-01-10 06:45:47,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 152 transitions, 684 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:45:47,221 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 312 flow [2025-01-10 06:45:47,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2025-01-10 06:45:47,221 INFO L279 CegarLoopForPetriNet]: 86 programPoint places, 14 predicate places. [2025-01-10 06:45:47,222 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 312 flow [2025-01-10 06:45:47,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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) [2025-01-10 06:45:47,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:47,222 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:45:47,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:45:47,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:45:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 620084673, now seen corresponding path program 1 times [2025-01-10 06:45:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:47,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268890489] [2025-01-10 06:45:47,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:47,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:47,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:47,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:47,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:47,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:45:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:45:47,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:45:47,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:47,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:45:47,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:45:47,262 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:45:47,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:45:47,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:45:47,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:45:47,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:45:47,265 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:45:47,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:45:47,287 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:45:47,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:47,302 INFO L124 PetriNetUnfolderBase]: 46/256 cut-off events. [2025-01-10 06:45:47,303 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:45:47,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 256 events. 46/256 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1042 event pairs, 1 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 178. Up to 12 conditions per place. [2025-01-10 06:45:47,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:47,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 133 transitions, 293 flow [2025-01-10 06:45:47,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:45:47,306 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@a6de7e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:45:47,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:45:47,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:45:47,308 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-01-10 06:45:47,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:45:47,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:47,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:45:47,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:47,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash 682693226, now seen corresponding path program 1 times [2025-01-10 06:45:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:47,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308400333] [2025-01-10 06:45:47,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:47,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:45:47,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:45:47,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:47,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:47,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308400333] [2025-01-10 06:45:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308400333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:45:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338495021] [2025-01-10 06:45:47,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:45:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:47,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:45:47,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:45:47,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:45:47,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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) [2025-01-10 06:45:47,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:47,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:45:47,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:45:56,222 INFO L124 PetriNetUnfolderBase]: 86447/153025 cut-off events. [2025-01-10 06:45:56,222 INFO L125 PetriNetUnfolderBase]: For 1911/1911 co-relation queries the response was YES. [2025-01-10 06:45:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271744 conditions, 153025 events. 86447/153025 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 3550. Compared 1598383 event pairs, 52468 based on Foata normal form. 31112/168963 useless extension candidates. Maximal degree in co-relation 17771. Up to 117557 conditions per place. [2025-01-10 06:45:57,132 INFO L140 encePairwiseOnDemand]: 107/133 looper letters, 78 selfloop transitions, 3 changer transitions 0/138 dead transitions. [2025-01-10 06:45:57,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 138 transitions, 465 flow [2025-01-10 06:45:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:45:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:45:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2025-01-10 06:45:57,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6466165413533834 [2025-01-10 06:45:57,134 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 293 flow. Second operand 4 states and 344 transitions. [2025-01-10 06:45:57,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 138 transitions, 465 flow [2025-01-10 06:45:57,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 138 transitions, 465 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:45:57,139 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 277 flow [2025-01-10 06:45:57,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2025-01-10 06:45:57,141 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-01-10 06:45:57,141 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 277 flow [2025-01-10 06:45:57,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 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) [2025-01-10 06:45:57,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:45:57,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:45:57,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:45:57,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:45:57,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:45:57,142 INFO L85 PathProgramCache]: Analyzing trace with hash 836468209, now seen corresponding path program 1 times [2025-01-10 06:45:57,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:45:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343942888] [2025-01-10 06:45:57,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:45:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:45:57,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:45:57,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:45:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:45:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:45:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:45:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:45:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343942888] [2025-01-10 06:45:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343942888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:45:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:45:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:45:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762505988] [2025-01-10 06:45:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:45:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:45:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:45:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:45:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:45:57,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:45:57,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 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) [2025-01-10 06:45:57,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:45:57,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:45:57,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:04,677 INFO L124 PetriNetUnfolderBase]: 71934/125227 cut-off events. [2025-01-10 06:46:04,677 INFO L125 PetriNetUnfolderBase]: For 8821/8821 co-relation queries the response was YES. [2025-01-10 06:46:04,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229845 conditions, 125227 events. 71934/125227 cut-off events. For 8821/8821 co-relation queries the response was YES. Maximal size of possible extension queue 2835. Compared 1262625 event pairs, 7896 based on Foata normal form. 1872/114780 useless extension candidates. Maximal degree in co-relation 19473. Up to 63134 conditions per place. [2025-01-10 06:46:05,394 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 140 selfloop transitions, 6 changer transitions 0/203 dead transitions. [2025-01-10 06:46:05,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 203 transitions, 743 flow [2025-01-10 06:46:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2025-01-10 06:46:05,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127819548872181 [2025-01-10 06:46:05,396 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 277 flow. Second operand 6 states and 489 transitions. [2025-01-10 06:46:05,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 203 transitions, 743 flow [2025-01-10 06:46:05,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 203 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:05,417 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 283 flow [2025-01-10 06:46:05,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2025-01-10 06:46:05,418 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-01-10 06:46:05,418 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 283 flow [2025-01-10 06:46:05,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 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) [2025-01-10 06:46:05,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:05,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:05,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:46:05,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 566229265, now seen corresponding path program 1 times [2025-01-10 06:46:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312790823] [2025-01-10 06:46:05,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:05,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:05,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:05,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:05,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:05,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:05,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312790823] [2025-01-10 06:46:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312790823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:05,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575756205] [2025-01-10 06:46:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:05,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:05,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:05,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 133 [2025-01-10 06:46:05,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:05,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:05,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 133 [2025-01-10 06:46:05,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:17,795 INFO L124 PetriNetUnfolderBase]: 123460/213529 cut-off events. [2025-01-10 06:46:17,795 INFO L125 PetriNetUnfolderBase]: For 18650/20898 co-relation queries the response was YES. [2025-01-10 06:46:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392961 conditions, 213529 events. 123460/213529 cut-off events. For 18650/20898 co-relation queries the response was YES. Maximal size of possible extension queue 4971. Compared 2243889 event pairs, 39792 based on Foata normal form. 3005/196353 useless extension candidates. Maximal degree in co-relation 265555. Up to 115524 conditions per place. [2025-01-10 06:46:19,398 INFO L140 encePairwiseOnDemand]: 122/133 looper letters, 174 selfloop transitions, 16 changer transitions 0/248 dead transitions. [2025-01-10 06:46:19,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 248 transitions, 1015 flow [2025-01-10 06:46:19,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2025-01-10 06:46:19,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7233082706766917 [2025-01-10 06:46:19,401 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 283 flow. Second operand 5 states and 481 transitions. [2025-01-10 06:46:19,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 248 transitions, 1015 flow [2025-01-10 06:46:19,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 248 transitions, 992 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:46:19,415 INFO L231 Difference]: Finished difference. Result has 126 places, 129 transitions, 399 flow [2025-01-10 06:46:19,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=126, PETRI_TRANSITIONS=129} [2025-01-10 06:46:19,415 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 12 predicate places. [2025-01-10 06:46:19,416 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 129 transitions, 399 flow [2025-01-10 06:46:19,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:19,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:19,416 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:19,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:46:19,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 160711402, now seen corresponding path program 1 times [2025-01-10 06:46:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863682879] [2025-01-10 06:46:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:19,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:19,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863682879] [2025-01-10 06:46:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863682879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021885767] [2025-01-10 06:46:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:19,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 133 [2025-01-10 06:46:19,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 129 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 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) [2025-01-10 06:46:19,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:19,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 133 [2025-01-10 06:46:19,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand