./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.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/pthread-ext/36_stack_cas_p0_vs_concur.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 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:35:07,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:35:07,847 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:35:07,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:35:07,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:35:07,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:35:07,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:35:07,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:35:07,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:35:07,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:35:07,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:35:07,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:35:07,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:35:07,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:35:07,882 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:35:07,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:35:07,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:35:07,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:35:07,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:35:07,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:35:07,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:35:07,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:35:07,885 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 -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2025-01-10 06:35:08,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:35:08,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:35:08,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:35:08,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:35:08,121 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:35:08,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-01-10 06:35:09,403 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b490eab0/9d0439233f8b4a36b36d3f09fd23fa5f/FLAG9dd0afca0 [2025-01-10 06:35:09,708 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:35:09,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-01-10 06:35:09,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b490eab0/9d0439233f8b4a36b36d3f09fd23fa5f/FLAG9dd0afca0 [2025-01-10 06:35:09,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b490eab0/9d0439233f8b4a36b36d3f09fd23fa5f [2025-01-10 06:35:09,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:35:09,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:35:09,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:35:09,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:35:09,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:35:09,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:35:09" (1/1) ... [2025-01-10 06:35:09,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:09, skipping insertion in model container [2025-01-10 06:35:09,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:35:09" (1/1) ... [2025-01-10 06:35:09,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:35:10,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:35:10,036 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:35:10,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:35:10,114 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:35:10,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10 WrapperNode [2025-01-10 06:35:10,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:35:10,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:35:10,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:35:10,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:35:10,121 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:35:10" (1/1) ... [2025-01-10 06:35:10,129 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:35:10" (1/1) ... [2025-01-10 06:35:10,149 INFO L138 Inliner]: procedures = 172, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 170 [2025-01-10 06:35:10,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:35:10,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:35:10,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:35:10,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:35:10,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,178 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 6, 3]. 38 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 5 writes are split as follows [0, 1, 2, 2]. [2025-01-10 06:35:10,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:35:10,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:35:10,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:35:10,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:35:10,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (1/1) ... [2025-01-10 06:35:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:35:10,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:35:10,234 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:35:10,237 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:35:10,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 06:35:10,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:35:10,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:35:10,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:35:10,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:35:10,257 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:35:10,361 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:35:10,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:35:10,615 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:35:10,616 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:35:10,962 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:35:10,963 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 06:35:10,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:35:10 BoogieIcfgContainer [2025-01-10 06:35:10,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:35:10,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:35:10,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:35:10,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:35:10,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:35:09" (1/3) ... [2025-01-10 06:35:10,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ea7608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:35:10, skipping insertion in model container [2025-01-10 06:35:10,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:35:10" (2/3) ... [2025-01-10 06:35:10,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ea7608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:35:10, skipping insertion in model container [2025-01-10 06:35:10,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:35:10" (3/3) ... [2025-01-10 06:35:10,974 INFO L128 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2025-01-10 06:35:10,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:35:10,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36_stack_cas_p0_vs_concur.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-01-10 06:35:10,989 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:35:11,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:35:11,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 34 transitions, 72 flow [2025-01-10 06:35:11,082 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2025-01-10 06:35:11,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:35:11,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 56 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-01-10 06:35:11,089 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 34 transitions, 72 flow [2025-01-10 06:35:11,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 72 flow [2025-01-10 06:35:11,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:35:11,120 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;@6119e121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:35:11,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:35:11,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:35:11,125 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 06:35:11,125 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:35:11,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:11,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:35:11,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:35:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1367184029, now seen corresponding path program 1 times [2025-01-10 06:35:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-01-10 06:35:11,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:11,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:11,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:11,683 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:35:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:11,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-01-10 06:35:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509665093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:35:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342137267] [2025-01-10 06:35:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:11,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:35:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:11,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:35:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:35:11,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-01-10 06:35:11,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:35:11,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:11,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-01-10 06:35:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:11,825 INFO L124 PetriNetUnfolderBase]: 36/110 cut-off events. [2025-01-10 06:35:11,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:35:11,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 110 events. 36/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 241 event pairs, 2 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 188. Up to 77 conditions per place. [2025-01-10 06:35:11,828 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 21 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-01-10 06:35:11,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 114 flow [2025-01-10 06:35:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:35:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:35:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-10 06:35:11,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2025-01-10 06:35:11,841 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 72 flow. Second operand 3 states and 64 transitions. [2025-01-10 06:35:11,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 114 flow [2025-01-10 06:35:11,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:35:11,847 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 76 flow [2025-01-10 06:35:11,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-01-10 06:35:11,851 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-01-10 06:35:11,853 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 76 flow [2025-01-10 06:35:11,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:35:11,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:11,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:35:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:35:11,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:35:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1367169019, now seen corresponding path program 1 times [2025-01-10 06:35:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:11,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082151543] [2025-01-10 06:35:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:12,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:12,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:12,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:12,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:35:12,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:12,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:12,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:12,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:35:12,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:35:12,216 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-01-10 06:35:12,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2025-01-10 06:35:12,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-01-10 06:35:12,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-01-10 06:35:12,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-01-10 06:35:12,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:35:12,223 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:35:12,225 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:35:12,225 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:35:12,263 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:35:12,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 63 transitions, 136 flow [2025-01-10 06:35:12,284 INFO L124 PetriNetUnfolderBase]: 6/68 cut-off events. [2025-01-10 06:35:12,288 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:35:12,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 6/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 183 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2025-01-10 06:35:12,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 63 transitions, 136 flow [2025-01-10 06:35:12,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 136 flow [2025-01-10 06:35:12,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:35:12,294 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;@6119e121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:35:12,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-10 06:35:12,304 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:35:12,304 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:35:12,304 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:35:12,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:12,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:35:12,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-01-10 06:35:12,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1063163587, now seen corresponding path program 1 times [2025-01-10 06:35:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-01-10 06:35:12,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:12,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:12,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:12,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:12,543 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:35:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:12,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312040161] [2025-01-10 06:35:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312040161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:12,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:35:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136721804] [2025-01-10 06:35:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:12,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:35:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:12,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:35:12,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:35:12,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 63 [2025-01-10 06:35:12,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:35:12,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:12,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 63 [2025-01-10 06:35:12,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:12,888 INFO L124 PetriNetUnfolderBase]: 1282/2269 cut-off events. [2025-01-10 06:35:12,889 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 06:35:12,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2269 events. 1282/2269 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11908 event pairs, 480 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 3771. Up to 1985 conditions per place. [2025-01-10 06:35:12,905 INFO L140 encePairwiseOnDemand]: 43/63 looper letters, 39 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-01-10 06:35:12,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 217 flow [2025-01-10 06:35:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:35:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:35:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-10 06:35:12,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-01-10 06:35:12,907 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 136 flow. Second operand 3 states and 119 transitions. [2025-01-10 06:35:12,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 217 flow [2025-01-10 06:35:12,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:35:12,909 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 143 flow [2025-01-10 06:35:12,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2025-01-10 06:35:12,910 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 06:35:12,910 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 143 flow [2025-01-10 06:35:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:35:12,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:12,910 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:35:12,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:35:12,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-01-10 06:35:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 502033124, now seen corresponding path program 1 times [2025-01-10 06:35:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671323923] [2025-01-10 06:35:12,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:35:13,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:35:13,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:13,253 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:35:13,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671323923] [2025-01-10 06:35:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671323923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:35:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625505099] [2025-01-10 06:35:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:13,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:35:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:13,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:35:13,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:35:13,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 63 [2025-01-10 06:35:13,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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:35:13,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:13,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 63 [2025-01-10 06:35:13,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:13,636 INFO L124 PetriNetUnfolderBase]: 1731/3138 cut-off events. [2025-01-10 06:35:13,636 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-01-10 06:35:13,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 3138 events. 1731/3138 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 18005 event pairs, 300 based on Foata normal form. 60/2545 useless extension candidates. Maximal degree in co-relation 5716. Up to 2312 conditions per place. [2025-01-10 06:35:13,653 INFO L140 encePairwiseOnDemand]: 55/63 looper letters, 77 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2025-01-10 06:35:13,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 448 flow [2025-01-10 06:35:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:35:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:35:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2025-01-10 06:35:13,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-01-10 06:35:13,655 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 143 flow. Second operand 6 states and 180 transitions. [2025-01-10 06:35:13,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 448 flow [2025-01-10 06:35:13,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:35:13,658 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 202 flow [2025-01-10 06:35:13,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2025-01-10 06:35:13,659 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-10 06:35:13,659 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 202 flow [2025-01-10 06:35:13,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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:35:13,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:13,659 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 06:35:13,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:35:13,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 28 more)] === [2025-01-10 06:35:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1403315916, now seen corresponding path program 1 times [2025-01-10 06:35:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533311259] [2025-01-10 06:35:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:35:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:35:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:13,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:13,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:35:13,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:35:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:35:13,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:13,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:13,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:35:13,945 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:35:13,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-01-10 06:35:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 31 remaining) [2025-01-10 06:35:13,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 31 remaining) [2025-01-10 06:35:13,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 31 remaining) [2025-01-10 06:35:13,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 31 remaining) [2025-01-10 06:35:13,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 31 remaining) [2025-01-10 06:35:13,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 31 remaining) [2025-01-10 06:35:13,949 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 31 remaining) [2025-01-10 06:35:13,950 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 31 remaining) [2025-01-10 06:35:13,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:35:13,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 06:35:13,950 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:35:13,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:35:14,001 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:35:14,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 202 flow [2025-01-10 06:35:14,017 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2025-01-10 06:35:14,017 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:35:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 9/100 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 87. Up to 4 conditions per place. [2025-01-10 06:35:14,020 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 92 transitions, 202 flow [2025-01-10 06:35:14,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-01-10 06:35:14,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:35:14,026 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;@6119e121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:35:14,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-01-10 06:35:14,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:35:14,029 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:35:14,029 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:35:14,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:14,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:35:14,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:35:14,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1659348513, now seen corresponding path program 1 times [2025-01-10 06:35:14,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:14,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-01-10 06:35:14,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:14,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:14,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:14,320 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:35:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932029002] [2025-01-10 06:35:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932029002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:35:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708031574] [2025-01-10 06:35:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:14,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:35:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:14,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:35:14,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:35:14,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 92 [2025-01-10 06:35:14,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:35:14,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:14,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 92 [2025-01-10 06:35:14,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:17,252 INFO L124 PetriNetUnfolderBase]: 30591/44612 cut-off events. [2025-01-10 06:35:17,253 INFO L125 PetriNetUnfolderBase]: For 1424/1424 co-relation queries the response was YES. [2025-01-10 06:35:17,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87050 conditions, 44612 events. 30591/44612 cut-off events. For 1424/1424 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 289703 event pairs, 15869 based on Foata normal form. 0/34921 useless extension candidates. Maximal degree in co-relation 70785. Up to 41384 conditions per place. [2025-01-10 06:35:17,500 INFO L140 encePairwiseOnDemand]: 63/92 looper letters, 57 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2025-01-10 06:35:17,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 86 transitions, 324 flow [2025-01-10 06:35:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:35:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:35:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-01-10 06:35:17,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2025-01-10 06:35:17,502 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 174 transitions. [2025-01-10 06:35:17,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 86 transitions, 324 flow [2025-01-10 06:35:17,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 320 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-10 06:35:17,505 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 210 flow [2025-01-10 06:35:17,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2025-01-10 06:35:17,506 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -10 predicate places. [2025-01-10 06:35:17,506 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 210 flow [2025-01-10 06:35:17,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:35:17,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:17,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:35:17,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:35:17,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:35:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1201080904, now seen corresponding path program 1 times [2025-01-10 06:35:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116724167] [2025-01-10 06:35:17,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:17,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:35:17,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:35:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:17,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:17,872 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:35:17,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116724167] [2025-01-10 06:35:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116724167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:17,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:17,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:35:17,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434116129] [2025-01-10 06:35:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:17,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:35:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:17,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:35:17,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:35:17,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 92 [2025-01-10 06:35:17,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:35:17,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:17,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 92 [2025-01-10 06:35:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:21,288 INFO L124 PetriNetUnfolderBase]: 38256/56843 cut-off events. [2025-01-10 06:35:21,288 INFO L125 PetriNetUnfolderBase]: For 3107/3107 co-relation queries the response was YES. [2025-01-10 06:35:21,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120410 conditions, 56843 events. 38256/56843 cut-off events. For 3107/3107 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 399869 event pairs, 11699 based on Foata normal form. 807/44960 useless extension candidates. Maximal degree in co-relation 113761. Up to 47786 conditions per place. [2025-01-10 06:35:21,733 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 121 selfloop transitions, 12 changer transitions 0/156 dead transitions. [2025-01-10 06:35:21,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 713 flow [2025-01-10 06:35:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:35:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:35:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-01-10 06:35:21,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49818840579710144 [2025-01-10 06:35:21,735 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 210 flow. Second operand 6 states and 275 transitions. [2025-01-10 06:35:21,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 713 flow [2025-01-10 06:35:21,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 156 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:35:21,739 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 289 flow [2025-01-10 06:35:21,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2025-01-10 06:35:21,739 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-01-10 06:35:21,739 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 289 flow [2025-01-10 06:35:21,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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:35:21,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:21,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:35:21,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:35:21,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:35:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash -127570739, now seen corresponding path program 1 times [2025-01-10 06:35:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299863052] [2025-01-10 06:35:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:35:21,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:35:21,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:21,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:21,952 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:35:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:21,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299863052] [2025-01-10 06:35:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299863052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:21,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:35:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620845979] [2025-01-10 06:35:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:21,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:35:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:35:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:35:21,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 92 [2025-01-10 06:35:21,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:35:21,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:21,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 92 [2025-01-10 06:35:21,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:35:26,488 INFO L124 PetriNetUnfolderBase]: 44599/66777 cut-off events. [2025-01-10 06:35:26,488 INFO L125 PetriNetUnfolderBase]: For 18117/18144 co-relation queries the response was YES. [2025-01-10 06:35:26,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151499 conditions, 66777 events. 44599/66777 cut-off events. For 18117/18144 co-relation queries the response was YES. Maximal size of possible extension queue 1676. Compared 487178 event pairs, 17993 based on Foata normal form. 864/55965 useless extension candidates. Maximal degree in co-relation 142289. Up to 56678 conditions per place. [2025-01-10 06:35:27,130 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 127 selfloop transitions, 12 changer transitions 0/162 dead transitions. [2025-01-10 06:35:27,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 162 transitions, 808 flow [2025-01-10 06:35:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:35:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:35:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2025-01-10 06:35:27,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945652173913043 [2025-01-10 06:35:27,132 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 289 flow. Second operand 6 states and 273 transitions. [2025-01-10 06:35:27,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 162 transitions, 808 flow [2025-01-10 06:35:27,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 162 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:35:27,146 INFO L231 Difference]: Finished difference. Result has 94 places, 95 transitions, 376 flow [2025-01-10 06:35:27,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=94, PETRI_TRANSITIONS=95} [2025-01-10 06:35:27,147 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2025-01-10 06:35:27,147 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 95 transitions, 376 flow [2025-01-10 06:35:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:35:27,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:27,147 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 06:35:27,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:35:27,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:35:27,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1762007334, now seen corresponding path program 1 times [2025-01-10 06:35:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:27,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-01-10 06:35:27,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:27,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:35:27,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:35:27,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:27,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:27,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:35:27,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:35:27,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:35:27,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:27,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:35:27,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:35:27,383 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2025-01-10 06:35:27,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2025-01-10 06:35:27,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2025-01-10 06:35:27,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:35:27,385 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 06:35:27,385 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:35:27,385 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:35:27,423 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:35:27,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 121 transitions, 270 flow [2025-01-10 06:35:27,434 INFO L124 PetriNetUnfolderBase]: 12/132 cut-off events. [2025-01-10 06:35:27,434 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:35:27,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 132 events. 12/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 514 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 115. Up to 5 conditions per place. [2025-01-10 06:35:27,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 121 transitions, 270 flow [2025-01-10 06:35:27,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 121 transitions, 270 flow [2025-01-10 06:35:27,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:35:27,439 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;@6119e121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:35:27,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-10 06:35:27,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:35:27,441 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-01-10 06:35:27,441 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:35:27,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:35:27,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:35:27,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 06:35:27,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:35:27,441 INFO L85 PathProgramCache]: Analyzing trace with hash 944841345, now seen corresponding path program 1 times [2025-01-10 06:35:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:35:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-01-10 06:35:27,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:35:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:35:27,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:35:27,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:35:27,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:35:27,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:35:27,701 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:35:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:35:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-01-10 06:35:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008650586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:35:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:35:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:35:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757063559] [2025-01-10 06:35:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:35:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:35:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:35:27,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:35:27,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:35:27,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 121 [2025-01-10 06:35:27,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 121 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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:35:27,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:35:27,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 121 [2025-01-10 06:35:27,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand