./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:14:49,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:14:49,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 15:14:49,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:14:49,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:14:49,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:14:49,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:14:49,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:14:49,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:14:49,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:14:49,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 15:14:49,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 15:14:49,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:14:49,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:14:49,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:14:49,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:14:49,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 15:14:49,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:14:49,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:14:49,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:14:49,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:14:49,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 15:14:49,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 15:14:49,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 15:14:49,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:14:49,871 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 15:14:49,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:14:49,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:14:49,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:14:49,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:14:49,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:14:49,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:14:49,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 15:14:49,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 15:14:49,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 15:14:49,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:14:49,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 15:14:49,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 15:14:49,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:14:49,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 15:14:49,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 15:14:49,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 15:14:49,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 15:14:49,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 15:14:49,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2024-11-09 15:14:50,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:14:50,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:14:50,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:14:50,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:14:50,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:14:50,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2024-11-09 15:14:51,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:14:51,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:14:51,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2024-11-09 15:14:51,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c474eedd/227c3aa3138d4b45a43c8e7a0f212f36/FLAGd90088597 [2024-11-09 15:14:52,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c474eedd/227c3aa3138d4b45a43c8e7a0f212f36 [2024-11-09 15:14:52,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:14:52,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:14:52,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:14:52,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:14:52,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:14:52,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6278a73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52, skipping insertion in model container [2024-11-09 15:14:52,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:14:52,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:14:52,244 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:14:52,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:14:52,290 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:14:52,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52 WrapperNode [2024-11-09 15:14:52,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:14:52,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:14:52,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:14:52,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:14:52,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,338 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 276 [2024-11-09 15:14:52,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:14:52,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:14:52,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:14:52,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:14:52,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,377 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-09 15:14:52,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:14:52,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:14:52,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:14:52,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:14:52,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (1/1) ... [2024-11-09 15:14:52,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 15:14:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:52,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 15:14:52,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 15:14:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:14:52,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 15:14:52,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 15:14:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 15:14:52,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 15:14:52,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 15:14:52,483 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 15:14:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:14:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:14:52,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:14:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:14:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 15:14:52,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 15:14:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 15:14:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:14:52,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:14:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:14:52,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:14:52,488 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 15:14:52,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:14:52,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:14:53,194 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 15:14:53,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:14:53,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:14:53,532 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 15:14:53,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:14:53 BoogieIcfgContainer [2024-11-09 15:14:53,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:14:53,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 15:14:53,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 15:14:53,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 15:14:53,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:14:52" (1/3) ... [2024-11-09 15:14:53,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e9f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:14:53, skipping insertion in model container [2024-11-09 15:14:53,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:52" (2/3) ... [2024-11-09 15:14:53,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e9f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:14:53, skipping insertion in model container [2024-11-09 15:14:53,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:14:53" (3/3) ... [2024-11-09 15:14:53,540 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2024-11-09 15:14:53,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 15:14:53,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-11-09 15:14:53,553 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 15:14:53,623 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 15:14:53,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 105 transitions, 231 flow [2024-11-09 15:14:53,688 INFO L124 PetriNetUnfolderBase]: 11/102 cut-off events. [2024-11-09 15:14:53,688 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 15:14:53,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 11/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 250 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2024-11-09 15:14:53,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 105 transitions, 231 flow [2024-11-09 15:14:53,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 220 flow [2024-11-09 15:14:53,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 15:14:53,710 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;@1131a15f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 15:14:53,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2024-11-09 15:14:53,712 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 15:14:53,713 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2024-11-09 15:14:53,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 15:14:53,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:53,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 15:14:53,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1041504, now seen corresponding path program 1 times [2024-11-09 15:14:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143724214] [2024-11-09 15:14:53,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:53,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143724214] [2024-11-09 15:14:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143724214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:14:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:14:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:14:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016960103] [2024-11-09 15:14:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:14:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 15:14:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:14:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:14:54,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2024-11-09 15:14:54,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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) [2024-11-09 15:14:54,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:54,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2024-11-09 15:14:54,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:54,507 INFO L124 PetriNetUnfolderBase]: 1153/2343 cut-off events. [2024-11-09 15:14:54,507 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-09 15:14:54,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4036 conditions, 2343 events. 1153/2343 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16172 event pairs, 826 based on Foata normal form. 3/1752 useless extension candidates. Maximal degree in co-relation 3589. Up to 1545 conditions per place. [2024-11-09 15:14:54,529 INFO L140 encePairwiseOnDemand]: 87/105 looper letters, 52 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2024-11-09 15:14:54,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 358 flow [2024-11-09 15:14:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:14:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 15:14:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 266 transitions. [2024-11-09 15:14:54,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-09 15:14:54,546 INFO L175 Difference]: Start difference. First operand has 100 places, 101 transitions, 220 flow. Second operand 4 states and 266 transitions. [2024-11-09 15:14:54,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 358 flow [2024-11-09 15:14:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 346 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 15:14:54,560 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 292 flow [2024-11-09 15:14:54,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2024-11-09 15:14:54,567 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2024-11-09 15:14:54,567 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 292 flow [2024-11-09 15:14:54,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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) [2024-11-09 15:14:54,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:54,568 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-09 15:14:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 15:14:54,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 963766068, now seen corresponding path program 1 times [2024-11-09 15:14:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:54,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034355449] [2024-11-09 15:14:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:54,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034355449] [2024-11-09 15:14:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034355449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:14:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045128815] [2024-11-09 15:14:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:54,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:54,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:14:54,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 15:14:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:54,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:14:54,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:14:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:54,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:14:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045128815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:14:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:14:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-09 15:14:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666983769] [2024-11-09 15:14:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:14:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 15:14:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 15:14:54,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:14:54,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2024-11-09 15:14:54,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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) [2024-11-09 15:14:54,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:54,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2024-11-09 15:14:54,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:55,207 INFO L124 PetriNetUnfolderBase]: 1153/2340 cut-off events. [2024-11-09 15:14:55,208 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-11-09 15:14:55,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 2340 events. 1153/2340 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16144 event pairs, 826 based on Foata normal form. 3/1754 useless extension candidates. Maximal degree in co-relation 3898. Up to 1530 conditions per place. [2024-11-09 15:14:55,221 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 42 selfloop transitions, 17 changer transitions 0/105 dead transitions. [2024-11-09 15:14:55,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 398 flow [2024-11-09 15:14:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:14:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 15:14:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 356 transitions. [2024-11-09 15:14:55,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2024-11-09 15:14:55,228 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 292 flow. Second operand 6 states and 356 transitions. [2024-11-09 15:14:55,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 398 flow [2024-11-09 15:14:55,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 398 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 15:14:55,231 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 314 flow [2024-11-09 15:14:55,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2024-11-09 15:14:55,232 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2024-11-09 15:14:55,233 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 314 flow [2024-11-09 15:14:55,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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) [2024-11-09 15:14:55,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:55,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:14:55,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 15:14:55,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:55,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:55,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash 964607810, now seen corresponding path program 1 times [2024-11-09 15:14:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:55,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971038487] [2024-11-09 15:14:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:55,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:55,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971038487] [2024-11-09 15:14:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971038487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:14:55,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:14:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:14:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044167769] [2024-11-09 15:14:55,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:14:55,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 15:14:55,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:14:55,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:14:55,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 105 [2024-11-09 15:14:55,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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) [2024-11-09 15:14:55,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:55,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 105 [2024-11-09 15:14:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:55,809 INFO L124 PetriNetUnfolderBase]: 1154/2357 cut-off events. [2024-11-09 15:14:55,809 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-09 15:14:55,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 2357 events. 1154/2357 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16166 event pairs, 826 based on Foata normal form. 4/1771 useless extension candidates. Maximal degree in co-relation 3934. Up to 1545 conditions per place. [2024-11-09 15:14:55,820 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 63 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2024-11-09 15:14:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 470 flow [2024-11-09 15:14:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:14:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 15:14:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-11-09 15:14:55,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2024-11-09 15:14:55,822 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 314 flow. Second operand 4 states and 242 transitions. [2024-11-09 15:14:55,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 110 transitions, 470 flow [2024-11-09 15:14:55,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 432 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-09 15:14:55,825 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 340 flow [2024-11-09 15:14:55,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2024-11-09 15:14:55,825 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2024-11-09 15:14:55,825 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 340 flow [2024-11-09 15:14:55,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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) [2024-11-09 15:14:55,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:55,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:14:55,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 15:14:55,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:55,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash -161927917, now seen corresponding path program 1 times [2024-11-09 15:14:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:55,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256496212] [2024-11-09 15:14:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256496212] [2024-11-09 15:14:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256496212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:14:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:14:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:14:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887499900] [2024-11-09 15:14:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:14:55,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 15:14:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:55,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:14:55,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:14:55,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2024-11-09 15:14:55,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-11-09 15:14:55,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:55,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2024-11-09 15:14:55,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:56,202 INFO L124 PetriNetUnfolderBase]: 1153/2356 cut-off events. [2024-11-09 15:14:56,202 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-11-09 15:14:56,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 2356 events. 1153/2356 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16153 event pairs, 826 based on Foata normal form. 1/1772 useless extension candidates. Maximal degree in co-relation 3946. Up to 1549 conditions per place. [2024-11-09 15:14:56,213 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 56 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-11-09 15:14:56,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 107 transitions, 452 flow [2024-11-09 15:14:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:14:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 15:14:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2024-11-09 15:14:56,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2024-11-09 15:14:56,214 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 340 flow. Second operand 3 states and 215 transitions. [2024-11-09 15:14:56,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 107 transitions, 452 flow [2024-11-09 15:14:56,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 107 transitions, 452 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 15:14:56,217 INFO L231 Difference]: Finished difference. Result has 101 places, 107 transitions, 340 flow [2024-11-09 15:14:56,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=101, PETRI_TRANSITIONS=107} [2024-11-09 15:14:56,218 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 1 predicate places. [2024-11-09 15:14:56,218 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 107 transitions, 340 flow [2024-11-09 15:14:56,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-11-09 15:14:56,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:56,218 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-11-09 15:14:56,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 15:14:56,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:56,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash -188021864, now seen corresponding path program 1 times [2024-11-09 15:14:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035114471] [2024-11-09 15:14:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035114471] [2024-11-09 15:14:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035114471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:14:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482588752] [2024-11-09 15:14:56,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:56,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:56,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:14:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 15:14:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:56,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:14:56,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:14:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:56,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:14:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482588752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:14:56,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:14:56,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-11-09 15:14:56,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997464180] [2024-11-09 15:14:56,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:14:56,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 15:14:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 15:14:56,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 15:14:56,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2024-11-09 15:14:56,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 107 transitions, 340 flow. Second operand has 12 states, 12 states have (on average 50.083333333333336) internal successors, (601), 12 states have internal predecessors, (601), 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) [2024-11-09 15:14:56,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:56,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2024-11-09 15:14:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:56,743 INFO L124 PetriNetUnfolderBase]: 1162/2392 cut-off events. [2024-11-09 15:14:56,743 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-09 15:14:56,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 2392 events. 1162/2392 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16368 event pairs, 826 based on Foata normal form. 9/1810 useless extension candidates. Maximal degree in co-relation 4107. Up to 1550 conditions per place. [2024-11-09 15:14:56,752 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 51 selfloop transitions, 37 changer transitions 0/134 dead transitions. [2024-11-09 15:14:56,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 134 transitions, 657 flow [2024-11-09 15:14:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 15:14:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 15:14:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 584 transitions. [2024-11-09 15:14:56,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5561904761904762 [2024-11-09 15:14:56,754 INFO L175 Difference]: Start difference. First operand has 101 places, 107 transitions, 340 flow. Second operand 10 states and 584 transitions. [2024-11-09 15:14:56,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 134 transitions, 657 flow [2024-11-09 15:14:56,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 15:14:56,757 INFO L231 Difference]: Finished difference. Result has 112 places, 134 transitions, 603 flow [2024-11-09 15:14:56,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=112, PETRI_TRANSITIONS=134} [2024-11-09 15:14:56,758 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2024-11-09 15:14:56,758 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 134 transitions, 603 flow [2024-11-09 15:14:56,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.083333333333336) internal successors, (601), 12 states have internal predecessors, (601), 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) [2024-11-09 15:14:56,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:56,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:14:56,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:14:56,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:56,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:56,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash -694835737, now seen corresponding path program 1 times [2024-11-09 15:14:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712349637] [2024-11-09 15:14:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:14:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712349637] [2024-11-09 15:14:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712349637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:14:57,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:14:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:14:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996851867] [2024-11-09 15:14:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:14:57,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 15:14:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:14:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:14:57,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 105 [2024-11-09 15:14:57,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 134 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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) [2024-11-09 15:14:57,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:57,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 105 [2024-11-09 15:14:57,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:57,249 INFO L124 PetriNetUnfolderBase]: 1160/2390 cut-off events. [2024-11-09 15:14:57,249 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2024-11-09 15:14:57,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4181 conditions, 2390 events. 1160/2390 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16250 event pairs, 826 based on Foata normal form. 2/1807 useless extension candidates. Maximal degree in co-relation 4078. Up to 1563 conditions per place. [2024-11-09 15:14:57,266 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 71 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2024-11-09 15:14:57,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 132 transitions, 755 flow [2024-11-09 15:14:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:14:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 15:14:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2024-11-09 15:14:57,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-11-09 15:14:57,268 INFO L175 Difference]: Start difference. First operand has 112 places, 134 transitions, 603 flow. Second operand 4 states and 275 transitions. [2024-11-09 15:14:57,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 132 transitions, 755 flow [2024-11-09 15:14:57,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 707 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-09 15:14:57,270 INFO L231 Difference]: Finished difference. Result has 112 places, 132 transitions, 565 flow [2024-11-09 15:14:57,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=565, PETRI_PLACES=112, PETRI_TRANSITIONS=132} [2024-11-09 15:14:57,272 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 12 predicate places. [2024-11-09 15:14:57,273 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 132 transitions, 565 flow [2024-11-09 15:14:57,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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) [2024-11-09 15:14:57,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:57,273 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2024-11-09 15:14:57,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 15:14:57,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:57,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -270275348, now seen corresponding path program 2 times [2024-11-09 15:14:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946490067] [2024-11-09 15:14:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:14:57,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946490067] [2024-11-09 15:14:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946490067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:14:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040042327] [2024-11-09 15:14:57,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:14:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:57,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:14:57,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 15:14:57,503 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 15:14:57,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:14:57,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:14:57,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:14:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 15:14:57,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:14:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 15:14:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040042327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:14:57,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:14:57,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 2, 2] total 12 [2024-11-09 15:14:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424588339] [2024-11-09 15:14:57,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:14:57,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 15:14:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:14:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:14:57,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2024-11-09 15:14:57,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 132 transitions, 565 flow. Second operand has 14 states, 14 states have (on average 50.142857142857146) internal successors, (702), 14 states have internal predecessors, (702), 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) [2024-11-09 15:14:57,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:57,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2024-11-09 15:14:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:58,168 INFO L124 PetriNetUnfolderBase]: 1163/2401 cut-off events. [2024-11-09 15:14:58,168 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-11-09 15:14:58,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4204 conditions, 2401 events. 1163/2401 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16320 event pairs, 826 based on Foata normal form. 4/1822 useless extension candidates. Maximal degree in co-relation 4065. Up to 1546 conditions per place. [2024-11-09 15:14:58,176 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 47 selfloop transitions, 47 changer transitions 0/140 dead transitions. [2024-11-09 15:14:58,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 808 flow [2024-11-09 15:14:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 15:14:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 15:14:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1271 transitions. [2024-11-09 15:14:58,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043650793650793 [2024-11-09 15:14:58,179 INFO L175 Difference]: Start difference. First operand has 112 places, 132 transitions, 565 flow. Second operand 24 states and 1271 transitions. [2024-11-09 15:14:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 808 flow [2024-11-09 15:14:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 140 transitions, 780 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 15:14:58,182 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 710 flow [2024-11-09 15:14:58,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=710, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2024-11-09 15:14:58,183 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 33 predicate places. [2024-11-09 15:14:58,183 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 710 flow [2024-11-09 15:14:58,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 50.142857142857146) internal successors, (702), 14 states have internal predecessors, (702), 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) [2024-11-09 15:14:58,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:58,184 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:14:58,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:14:58,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:58,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:58,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:58,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1856241909, now seen corresponding path program 1 times [2024-11-09 15:14:58,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101306562] [2024-11-09 15:14:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:14:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101306562] [2024-11-09 15:14:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101306562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:14:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868565482] [2024-11-09 15:14:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:58,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:14:58,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 15:14:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:58,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 15:14:58,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:14:58,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 15:14:58,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:14:58,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 15:14:58,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 15:14:58,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 15:14:58,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 15:14:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:14:58,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:14:58,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_100) c_~B~0.base) c_~B~0.offset) 9223372039002259456))) is different from false [2024-11-09 15:14:58,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:14:58,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-09 15:14:58,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:14:58,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-11-09 15:14:58,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 15:14:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 15:14:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868565482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:14:59,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:14:59,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 15:14:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912785907] [2024-11-09 15:14:59,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:14:59,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 15:14:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:14:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:14:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-09 15:14:59,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2024-11-09 15:14:59,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 710 flow. Second operand has 13 states, 13 states have (on average 38.84615384615385) internal successors, (505), 13 states have internal predecessors, (505), 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) [2024-11-09 15:14:59,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:14:59,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2024-11-09 15:14:59,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:14:59,470 INFO L124 PetriNetUnfolderBase]: 1161/2404 cut-off events. [2024-11-09 15:14:59,470 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2024-11-09 15:14:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 2404 events. 1161/2404 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16311 event pairs, 826 based on Foata normal form. 0/1817 useless extension candidates. Maximal degree in co-relation 4195. Up to 1529 conditions per place. [2024-11-09 15:14:59,480 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 91 selfloop transitions, 27 changer transitions 0/148 dead transitions. [2024-11-09 15:14:59,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 148 transitions, 962 flow [2024-11-09 15:14:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:14:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 15:14:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 487 transitions. [2024-11-09 15:14:59,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42164502164502166 [2024-11-09 15:14:59,482 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 710 flow. Second operand 11 states and 487 transitions. [2024-11-09 15:14:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 148 transitions, 962 flow [2024-11-09 15:14:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 148 transitions, 851 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-11-09 15:14:59,485 INFO L231 Difference]: Finished difference. Result has 132 places, 139 transitions, 651 flow [2024-11-09 15:14:59,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=651, PETRI_PLACES=132, PETRI_TRANSITIONS=139} [2024-11-09 15:14:59,486 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 32 predicate places. [2024-11-09 15:14:59,486 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 139 transitions, 651 flow [2024-11-09 15:14:59,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.84615384615385) internal successors, (505), 13 states have internal predecessors, (505), 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) [2024-11-09 15:14:59,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:14:59,486 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:14:59,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 15:14:59,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:59,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:14:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:14:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1708918148, now seen corresponding path program 1 times [2024-11-09 15:14:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:14:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427466148] [2024-11-09 15:14:59,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:14:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:14:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:14:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:14:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427466148] [2024-11-09 15:14:59,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427466148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:14:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746073459] [2024-11-09 15:14:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:14:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:14:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:14:59,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:14:59,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 15:15:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:15:00,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 15:15:00,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:15:00,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 15:15:00,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:15:00,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 15:15:00,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 15:15:00,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 15:15:00,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 15:15:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 15:15:00,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:15:00,138 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_127) c_~B~0.base) c_~B~0.offset) 4294967296)) is different from false [2024-11-09 15:15:00,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:15:00,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 15:15:00,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:15:00,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-09 15:15:00,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 15:15:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2024-11-09 15:15:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746073459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:15:00,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:15:00,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-09 15:15:00,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48478408] [2024-11-09 15:15:00,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:15:00,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 15:15:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:15:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 15:15:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-09 15:15:00,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 105 [2024-11-09 15:15:00,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 139 transitions, 651 flow. Second operand has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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) [2024-11-09 15:15:00,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:15:00,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 105 [2024-11-09 15:15:00,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:15:00,691 INFO L124 PetriNetUnfolderBase]: 1161/2403 cut-off events. [2024-11-09 15:15:00,691 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-09 15:15:00,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 2403 events. 1161/2403 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16301 event pairs, 826 based on Foata normal form. 1/1820 useless extension candidates. Maximal degree in co-relation 4171. Up to 1533 conditions per place. [2024-11-09 15:15:00,702 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 84 selfloop transitions, 28 changer transitions 0/142 dead transitions. [2024-11-09 15:15:00,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 142 transitions, 879 flow [2024-11-09 15:15:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 15:15:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 15:15:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 479 transitions. [2024-11-09 15:15:00,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4147186147186147 [2024-11-09 15:15:00,705 INFO L175 Difference]: Start difference. First operand has 132 places, 139 transitions, 651 flow. Second operand 11 states and 479 transitions. [2024-11-09 15:15:00,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 142 transitions, 879 flow [2024-11-09 15:15:00,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 142 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 15:15:00,708 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 693 flow [2024-11-09 15:15:00,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=693, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2024-11-09 15:15:00,709 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 39 predicate places. [2024-11-09 15:15:00,709 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 693 flow [2024-11-09 15:15:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.857142857142854) internal successors, (544), 14 states have internal predecessors, (544), 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) [2024-11-09 15:15:00,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:15:00,710 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:15:00,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 15:15:00,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:15:00,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:15:00,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:15:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1436854551, now seen corresponding path program 1 times [2024-11-09 15:15:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:15:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945611210] [2024-11-09 15:15:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:15:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:15:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:15:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:15:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:15:01,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945611210] [2024-11-09 15:15:01,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945611210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:15:01,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354435035] [2024-11-09 15:15:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:15:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:15:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:15:01,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:15:01,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 15:15:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:15:01,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:15:01,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:15:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 15:15:01,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:15:01,326 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 15:15:01,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 15:15:01,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 15:15:01,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 15:15:01,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 15:15:01,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 15:15:01,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 15:15:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:15:01,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:15:05,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:15:05,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 36 [2024-11-09 15:15:05,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:15:05,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 315 treesize of output 305 [2024-11-09 15:15:05,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 154 [2024-11-09 15:15:05,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:15:05,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 128 [2024-11-09 15:15:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:15:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354435035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:15:06,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:15:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-09 15:15:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376840887] [2024-11-09 15:15:06,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:15:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 15:15:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:15:06,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 15:15:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=377, Unknown=1, NotChecked=0, Total=462 [2024-11-09 15:15:10,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:14,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:18,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:22,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:26,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:30,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:34,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:15:34,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 105 [2024-11-09 15:15:34,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 693 flow. Second operand has 22 states, 22 states have (on average 34.59090909090909) internal successors, (761), 22 states have internal predecessors, (761), 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) [2024-11-09 15:15:34,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 15:15:34,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 105 [2024-11-09 15:15:34,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 15:15:38,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:15:43,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:15:44,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:15:48,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:15:52,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:15:56,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:16:00,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 15:16:01,466 INFO L124 PetriNetUnfolderBase]: 2108/3850 cut-off events. [2024-11-09 15:16:01,466 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2024-11-09 15:16:01,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 3850 events. 2108/3850 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 25146 event pairs, 710 based on Foata normal form. 1/2845 useless extension candidates. Maximal degree in co-relation 6995. Up to 1641 conditions per place. [2024-11-09 15:16:01,493 INFO L140 encePairwiseOnDemand]: 83/105 looper letters, 123 selfloop transitions, 36 changer transitions 0/185 dead transitions. [2024-11-09 15:16:01,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 185 transitions, 1145 flow [2024-11-09 15:16:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 15:16:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-09 15:16:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 722 transitions. [2024-11-09 15:16:01,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.382010582010582 [2024-11-09 15:16:01,498 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 693 flow. Second operand 18 states and 722 transitions. [2024-11-09 15:16:01,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 185 transitions, 1145 flow [2024-11-09 15:16:01,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 185 transitions, 1077 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-09 15:16:01,505 INFO L231 Difference]: Finished difference. Result has 149 places, 142 transitions, 747 flow [2024-11-09 15:16:01,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=747, PETRI_PLACES=149, PETRI_TRANSITIONS=142} [2024-11-09 15:16:01,506 INFO L277 CegarLoopForPetriNet]: 100 programPoint places, 49 predicate places. [2024-11-09 15:16:01,506 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 142 transitions, 747 flow [2024-11-09 15:16:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 34.59090909090909) internal successors, (761), 22 states have internal predecessors, (761), 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) [2024-11-09 15:16:01,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 15:16:01,507 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:16:01,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 15:16:01,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:16:01,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 46 more)] === [2024-11-09 15:16:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:16:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1592819132, now seen corresponding path program 1 times [2024-11-09 15:16:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:16:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429847939] [2024-11-09 15:16:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:16:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:16:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:16:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:16:02,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:16:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429847939] [2024-11-09 15:16:02,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429847939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:16:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184423138] [2024-11-09 15:16:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:16:02,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:16:02,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:16:02,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:16:02,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 15:16:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:16:02,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 15:16:02,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:16:02,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 15:16:02,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 15:16:02,352 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 15:16:02,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 15:16:02,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 15:16:02,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 15:16:02,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 15:16:02,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 15:16:02,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 15:16:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:16:02,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:16:07,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:16:07,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 34 [2024-11-09 15:16:07,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:16:07,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 139 [2024-11-09 15:16:07,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2024-11-09 15:16:07,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 15:16:07,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 110 [2024-11-09 15:16:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:16:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184423138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:16:07,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:16:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-09 15:16:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182688238] [2024-11-09 15:16:07,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:16:07,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 15:16:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:16:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 15:16:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=416, Unknown=2, NotChecked=0, Total=506 [2024-11-09 15:16:11,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:19,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:23,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:27,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:31,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 15:16:36,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]