./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 23:02:58,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 23:02:58,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 23:02:58,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 23:02:58,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 23:02:58,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 23:02:58,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 23:02:58,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 23:02:58,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 23:02:58,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 23:02:58,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 23:02:58,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 23:02:58,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 23:02:58,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 23:02:58,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 23:02:58,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 23:02:58,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 23:02:58,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 23:02:58,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 23:02:58,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 23:02:58,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 23:02:58,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 23:02:58,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 23:02:58,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 23:02:58,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 23:02:58,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 23:02:58,231 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-07 23:02:58,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 23:02:58,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 23:02:58,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 23:02:58,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 23:02:58,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 23:02:58,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-11-07 23:03:00,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 23:03:00,730 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 23:03:00,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-3.i [2024-11-07 23:03:00,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bf32662d/41c1824c2a35471bbcb000c2821996bc/FLAGcdcf9c418 [2024-11-07 23:03:00,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bf32662d/41c1824c2a35471bbcb000c2821996bc [2024-11-07 23:03:00,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 23:03:00,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 23:03:00,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 23:03:00,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 23:03:00,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 23:03:00,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:03:00" (1/1) ... [2024-11-07 23:03:00,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2484ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:00, skipping insertion in model container [2024-11-07 23:03:00,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:03:00" (1/1) ... [2024-11-07 23:03:01,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 23:03:01,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:03:01,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 23:03:01,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 23:03:01,563 INFO L204 MainTranslator]: Completed translation [2024-11-07 23:03:01,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01 WrapperNode [2024-11-07 23:03:01,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 23:03:01,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 23:03:01,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 23:03:01,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 23:03:01,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,730 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1870 [2024-11-07 23:03:01,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 23:03:01,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 23:03:01,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 23:03:01,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 23:03:01,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,878 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-07 23:03:01,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:01,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 23:03:02,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 23:03:02,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 23:03:02,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 23:03:02,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (1/1) ... [2024-11-07 23:03:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 23:03:02,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:02,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 23:03:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 23:03:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 23:03:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 23:03:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 23:03:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 23:03:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 23:03:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 23:03:02,275 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 23:03:02,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 23:03:03,890 INFO L? ?]: Removed 424 outVars from TransFormulas that were not future-live. [2024-11-07 23:03:03,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 23:03:03,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 23:03:03,909 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-07 23:03:03,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:03:03 BoogieIcfgContainer [2024-11-07 23:03:03,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 23:03:03,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 23:03:03,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 23:03:03,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 23:03:03,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:03:00" (1/3) ... [2024-11-07 23:03:03,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8691531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:03:03, skipping insertion in model container [2024-11-07 23:03:03,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:03:01" (2/3) ... [2024-11-07 23:03:03,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8691531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:03:03, skipping insertion in model container [2024-11-07 23:03:03,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:03:03" (3/3) ... [2024-11-07 23:03:03,917 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-3.i [2024-11-07 23:03:03,929 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 23:03:03,930 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 23:03:04,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 23:03:04,020 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;@67740e08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 23:03:04,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 23:03:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 23:03:04,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:04,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:04,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:04,038 INFO L85 PathProgramCache]: Analyzing trace with hash -699476840, now seen corresponding path program 1 times [2024-11-07 23:03:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373939191] [2024-11-07 23:03:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:04,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:04,168 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-07 23:03:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:04,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373939191] [2024-11-07 23:03:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373939191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:04,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 23:03:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818924554] [2024-11-07 23:03:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 23:03:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:04,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 23:03:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:03:04,193 INFO L87 Difference]: Start difference. First operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-07 23:03:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:04,260 INFO L93 Difference]: Finished difference Result 943 states and 1515 transitions. [2024-11-07 23:03:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 23:03:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2024-11-07 23:03:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:04,272 INFO L225 Difference]: With dead ends: 943 [2024-11-07 23:03:04,272 INFO L226 Difference]: Without dead ends: 398 [2024-11-07 23:03:04,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 23:03:04,281 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:04,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:03:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-07 23:03:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-07 23:03:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.443298969072165) internal successors, (560), 390 states have internal predecessors, (560), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2024-11-07 23:03:04,346 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 7 [2024-11-07 23:03:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2024-11-07 23:03:04,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-07 23:03:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2024-11-07 23:03:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 23:03:04,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:04,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:04,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 23:03:04,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -208885906, now seen corresponding path program 1 times [2024-11-07 23:03:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695258441] [2024-11-07 23:03:04,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:04,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 23:03:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722295851] [2024-11-07 23:03:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:04,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 23:03:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:04,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 23:03:04,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:04,661 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-07 23:03:04,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:03:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695258441] [2024-11-07 23:03:04,663 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 23:03:04,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722295851] [2024-11-07 23:03:04,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722295851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:04,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:04,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 23:03:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980303596] [2024-11-07 23:03:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 23:03:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:03:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:03:04,666 INFO L87 Difference]: Start difference. First operand 398 states and 572 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-07 23:03:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:04,738 INFO L93 Difference]: Finished difference Result 785 states and 1133 transitions. [2024-11-07 23:03:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:03:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2024-11-07 23:03:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:04,742 INFO L225 Difference]: With dead ends: 785 [2024-11-07 23:03:04,743 INFO L226 Difference]: Without dead ends: 784 [2024-11-07 23:03:04,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:03:04,745 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 543 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:04,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1182 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:03:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-07 23:03:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 403. [2024-11-07 23:03:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4376590330788803) internal successors, (565), 395 states have internal predecessors, (565), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 577 transitions. [2024-11-07 23:03:04,780 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 577 transitions. Word has length 8 [2024-11-07 23:03:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:04,780 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 577 transitions. [2024-11-07 23:03:04,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-07 23:03:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 577 transitions. [2024-11-07 23:03:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 23:03:04,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:04,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:04,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 23:03:04,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:04,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 839446148, now seen corresponding path program 1 times [2024-11-07 23:03:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311840482] [2024-11-07 23:03:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:05,746 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-07 23:03:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:05,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311840482] [2024-11-07 23:03:05,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311840482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:05,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:03:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772694601] [2024-11-07 23:03:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:05,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:03:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:03:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:03:05,749 INFO L87 Difference]: Start difference. First operand 403 states and 577 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-07 23:03:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:05,837 INFO L93 Difference]: Finished difference Result 801 states and 1149 transitions. [2024-11-07 23:03:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:03:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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) Word has length 152 [2024-11-07 23:03:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:05,841 INFO L225 Difference]: With dead ends: 801 [2024-11-07 23:03:05,841 INFO L226 Difference]: Without dead ends: 406 [2024-11-07 23:03:05,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:03:05,842 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 105 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:05,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1539 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 23:03:05,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-07 23:03:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2024-11-07 23:03:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4198473282442747) internal successors, (558), 395 states have internal predecessors, (558), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 570 transitions. [2024-11-07 23:03:05,861 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 570 transitions. Word has length 152 [2024-11-07 23:03:05,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:05,861 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 570 transitions. [2024-11-07 23:03:05,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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-07 23:03:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 570 transitions. [2024-11-07 23:03:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 23:03:05,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:05,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:05,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 23:03:05,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:05,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -609280240, now seen corresponding path program 1 times [2024-11-07 23:03:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:05,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50071596] [2024-11-07 23:03:05,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:06,169 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-07 23:03:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:06,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50071596] [2024-11-07 23:03:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50071596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 23:03:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625774437] [2024-11-07 23:03:06,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:06,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 23:03:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 23:03:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:03:06,173 INFO L87 Difference]: Start difference. First operand 403 states and 570 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-07 23:03:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:06,220 INFO L93 Difference]: Finished difference Result 925 states and 1319 transitions. [2024-11-07 23:03:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 23:03:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) Word has length 152 [2024-11-07 23:03:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:06,230 INFO L225 Difference]: With dead ends: 925 [2024-11-07 23:03:06,231 INFO L226 Difference]: Without dead ends: 530 [2024-11-07 23:03:06,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 23:03:06,233 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 134 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:06,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1120 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 23:03:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-07 23:03:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-11-07 23:03:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 520 states have (on average 1.4307692307692308) internal successors, (744), 522 states have internal predecessors, (744), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 756 transitions. [2024-11-07 23:03:06,255 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 756 transitions. Word has length 152 [2024-11-07 23:03:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:06,257 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 756 transitions. [2024-11-07 23:03:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-07 23:03:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 756 transitions. [2024-11-07 23:03:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:03:06,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:06,262 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:06,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 23:03:06,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:06,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 601390206, now seen corresponding path program 1 times [2024-11-07 23:03:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820926126] [2024-11-07 23:03:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:03:06,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:06,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820926126] [2024-11-07 23:03:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820926126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 23:03:06,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058785111] [2024-11-07 23:03:06,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:06,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:03:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:03:06,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:03:06,699 INFO L87 Difference]: Start difference. First operand 530 states and 756 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:07,067 INFO L93 Difference]: Finished difference Result 931 states and 1330 transitions. [2024-11-07 23:03:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:03:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:03:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:07,072 INFO L225 Difference]: With dead ends: 931 [2024-11-07 23:03:07,073 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 23:03:07,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:03:07,075 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 109 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:07,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1961 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:03:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 23:03:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2024-11-07 23:03:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 520 states have (on average 1.4173076923076924) internal successors, (737), 522 states have internal predecessors, (737), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 749 transitions. [2024-11-07 23:03:07,094 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 749 transitions. Word has length 167 [2024-11-07 23:03:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:07,095 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 749 transitions. [2024-11-07 23:03:07,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 749 transitions. [2024-11-07 23:03:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:03:07,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:07,100 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:07,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 23:03:07,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:07,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2124470064, now seen corresponding path program 1 times [2024-11-07 23:03:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539124189] [2024-11-07 23:03:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:03:07,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:07,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539124189] [2024-11-07 23:03:07,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539124189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:07,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:07,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:03:07,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820352725] [2024-11-07 23:03:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:03:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:03:07,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:03:07,395 INFO L87 Difference]: Start difference. First operand 530 states and 749 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:07,742 INFO L93 Difference]: Finished difference Result 934 states and 1322 transitions. [2024-11-07 23:03:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:03:07,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:03:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:07,746 INFO L225 Difference]: With dead ends: 934 [2024-11-07 23:03:07,746 INFO L226 Difference]: Without dead ends: 539 [2024-11-07 23:03:07,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:03:07,748 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 5 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:07,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1543 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:03:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-07 23:03:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2024-11-07 23:03:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 526 states have (on average 1.4125475285171103) internal successors, (743), 528 states have internal predecessors, (743), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 23:03:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 755 transitions. [2024-11-07 23:03:07,775 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 755 transitions. Word has length 167 [2024-11-07 23:03:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:07,775 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 755 transitions. [2024-11-07 23:03:07,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 755 transitions. [2024-11-07 23:03:07,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 23:03:07,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:07,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 23:03:07,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 586130034, now seen corresponding path program 1 times [2024-11-07 23:03:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287358994] [2024-11-07 23:03:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 23:03:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287358994] [2024-11-07 23:03:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287358994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:03:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792236885] [2024-11-07 23:03:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:03:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:03:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:03:08,055 INFO L87 Difference]: Start difference. First operand 536 states and 755 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:08,542 INFO L93 Difference]: Finished difference Result 1134 states and 1602 transitions. [2024-11-07 23:03:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:03:08,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-07 23:03:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:08,547 INFO L225 Difference]: With dead ends: 1134 [2024-11-07 23:03:08,547 INFO L226 Difference]: Without dead ends: 733 [2024-11-07 23:03:08,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 23:03:08,548 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 322 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:08,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1570 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 23:03:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-07 23:03:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-07 23:03:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 717 states have (on average 1.408647140864714) internal successors, (1010), 719 states have internal predecessors, (1010), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 23:03:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1028 transitions. [2024-11-07 23:03:08,568 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1028 transitions. Word has length 167 [2024-11-07 23:03:08,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:08,569 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1028 transitions. [2024-11-07 23:03:08,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 23:03:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1028 transitions. [2024-11-07 23:03:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 23:03:08,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:08,571 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:08,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 23:03:08,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:08,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1457835018, now seen corresponding path program 1 times [2024-11-07 23:03:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:08,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110044307] [2024-11-07 23:03:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:03:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:03:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110044307] [2024-11-07 23:03:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110044307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:08,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:08,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 23:03:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386437875] [2024-11-07 23:03:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:08,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:03:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:08,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:03:08,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:03:08,992 INFO L87 Difference]: Start difference. First operand 730 states and 1028 transitions. Second operand has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:09,780 INFO L93 Difference]: Finished difference Result 799 states and 1129 transitions. [2024-11-07 23:03:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:03:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-11-07 23:03:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:09,785 INFO L225 Difference]: With dead ends: 799 [2024-11-07 23:03:09,785 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 23:03:09,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:03:09,786 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 374 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:09,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 2105 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 23:03:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 23:03:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2024-11-07 23:03:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 778 states have (on average 1.398457583547558) internal successors, (1088), 780 states have internal predecessors, (1088), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1112 transitions. [2024-11-07 23:03:09,814 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1112 transitions. Word has length 182 [2024-11-07 23:03:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:09,815 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1112 transitions. [2024-11-07 23:03:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1112 transitions. [2024-11-07 23:03:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 23:03:09,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:09,818 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:09,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 23:03:09,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:09,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1287954457, now seen corresponding path program 1 times [2024-11-07 23:03:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760380335] [2024-11-07 23:03:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:03:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:03:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:03:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760380335] [2024-11-07 23:03:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760380335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523498189] [2024-11-07 23:03:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:10,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:10,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 23:03:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:11,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 23:03:11,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:11,651 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 11 treesize of output 7 [2024-11-07 23:03:11,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2024-11-07 23:03:12,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 23:03:12,186 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 54 treesize of output 38 [2024-11-07 23:03:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:12,585 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:03:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523498189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:12,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:03:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-07 23:03:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856014794] [2024-11-07 23:03:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:12,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 23:03:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:12,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 23:03:12,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 23:03:12,587 INFO L87 Difference]: Start difference. First operand 794 states and 1112 transitions. Second operand has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:16,515 INFO L93 Difference]: Finished difference Result 1553 states and 2170 transitions. [2024-11-07 23:03:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 23:03:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-07 23:03:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:16,520 INFO L225 Difference]: With dead ends: 1553 [2024-11-07 23:03:16,521 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 23:03:16,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-07 23:03:16,523 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 820 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:16,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 4032 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1467 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2024-11-07 23:03:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 23:03:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 828. [2024-11-07 23:03:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 812 states have (on average 1.3928571428571428) internal successors, (1131), 814 states have internal predecessors, (1131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1155 transitions. [2024-11-07 23:03:16,547 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1155 transitions. Word has length 188 [2024-11-07 23:03:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:16,547 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1155 transitions. [2024-11-07 23:03:16,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1155 transitions. [2024-11-07 23:03:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-07 23:03:16,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:16,550 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:16,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 23:03:16,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:16,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1603143653, now seen corresponding path program 1 times [2024-11-07 23:03:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545215218] [2024-11-07 23:03:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 23:03:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 23:03:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 23:03:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 23:03:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:16,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545215218] [2024-11-07 23:03:16,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545215218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:16,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:16,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 23:03:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904102565] [2024-11-07 23:03:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:16,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:03:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:03:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 23:03:16,975 INFO L87 Difference]: Start difference. First operand 828 states and 1155 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:17,351 INFO L93 Difference]: Finished difference Result 1499 states and 2098 transitions. [2024-11-07 23:03:17,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 23:03:17,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-07 23:03:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:17,355 INFO L225 Difference]: With dead ends: 1499 [2024-11-07 23:03:17,356 INFO L226 Difference]: Without dead ends: 701 [2024-11-07 23:03:17,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 23:03:17,358 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 12 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:17,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1739 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 23:03:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-07 23:03:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2024-11-07 23:03:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 682 states have (on average 1.3592375366568914) internal successors, (927), 684 states have internal predecessors, (927), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 951 transitions. [2024-11-07 23:03:17,381 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 951 transitions. Word has length 188 [2024-11-07 23:03:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:17,383 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 951 transitions. [2024-11-07 23:03:17,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 951 transitions. [2024-11-07 23:03:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-07 23:03:17,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:17,385 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:17,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 23:03:17,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:17,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1953126337, now seen corresponding path program 1 times [2024-11-07 23:03:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561754054] [2024-11-07 23:03:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 23:03:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 23:03:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 23:03:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 23:03:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:03:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561754054] [2024-11-07 23:03:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561754054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284285924] [2024-11-07 23:03:18,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:18,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:18,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:18,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 23:03:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:18,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 23:03:18,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:18,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:03:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284285924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:18,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:03:18,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-07 23:03:18,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989152808] [2024-11-07 23:03:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:18,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 23:03:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:18,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 23:03:18,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:18,820 INFO L87 Difference]: Start difference. First operand 698 states and 951 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:18,929 INFO L93 Difference]: Finished difference Result 1356 states and 1860 transitions. [2024-11-07 23:03:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 23:03:18,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-07 23:03:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:18,933 INFO L225 Difference]: With dead ends: 1356 [2024-11-07 23:03:18,933 INFO L226 Difference]: Without dead ends: 698 [2024-11-07 23:03:18,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:18,934 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 13 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:18,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1279 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 23:03:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-07 23:03:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-07 23:03:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 682 states have (on average 1.3563049853372433) internal successors, (925), 684 states have internal predecessors, (925), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 949 transitions. [2024-11-07 23:03:18,956 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 949 transitions. Word has length 189 [2024-11-07 23:03:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:18,956 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 949 transitions. [2024-11-07 23:03:18,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 949 transitions. [2024-11-07 23:03:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 23:03:18,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:18,960 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:18,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 23:03:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:19,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1539485556, now seen corresponding path program 1 times [2024-11-07 23:03:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:19,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382910189] [2024-11-07 23:03:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:19,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 23:03:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:19,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 23:03:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 23:03:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 23:03:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382910189] [2024-11-07 23:03:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382910189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 23:03:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738701709] [2024-11-07 23:03:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 23:03:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 23:03:19,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:19,607 INFO L87 Difference]: Start difference. First operand 698 states and 949 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:20,024 INFO L93 Difference]: Finished difference Result 1362 states and 1877 transitions. [2024-11-07 23:03:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 23:03:20,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2024-11-07 23:03:20,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:20,029 INFO L225 Difference]: With dead ends: 1362 [2024-11-07 23:03:20,029 INFO L226 Difference]: Without dead ends: 707 [2024-11-07 23:03:20,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:20,031 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 7 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:20,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2039 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:03:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-07 23:03:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 704. [2024-11-07 23:03:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 688 states have (on average 1.3531976744186047) internal successors, (931), 690 states have internal predecessors, (931), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 955 transitions. [2024-11-07 23:03:20,053 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 955 transitions. Word has length 190 [2024-11-07 23:03:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:20,053 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 955 transitions. [2024-11-07 23:03:20,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 23:03:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 955 transitions. [2024-11-07 23:03:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 23:03:20,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:20,056 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:20,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 23:03:20,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 148056766, now seen corresponding path program 1 times [2024-11-07 23:03:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660562005] [2024-11-07 23:03:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:03:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 23:03:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 23:03:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:03:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660562005] [2024-11-07 23:03:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660562005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084319585] [2024-11-07 23:03:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:20,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:20,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 23:03:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:21,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 23:03:21,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 23:03:21,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:03:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084319585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:03:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-07 23:03:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839050167] [2024-11-07 23:03:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:21,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 23:03:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 23:03:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:03:21,527 INFO L87 Difference]: Start difference. First operand 704 states and 955 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:21,942 INFO L93 Difference]: Finished difference Result 1253 states and 1697 transitions. [2024-11-07 23:03:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 23:03:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-07 23:03:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:21,945 INFO L225 Difference]: With dead ends: 1253 [2024-11-07 23:03:21,945 INFO L226 Difference]: Without dead ends: 786 [2024-11-07 23:03:21,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:03:21,946 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 12 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:21,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2233 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:03:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-07 23:03:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 778. [2024-11-07 23:03:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 762 states have (on average 1.337270341207349) internal successors, (1019), 764 states have internal predecessors, (1019), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1043 transitions. [2024-11-07 23:03:21,964 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1043 transitions. Word has length 191 [2024-11-07 23:03:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:21,964 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1043 transitions. [2024-11-07 23:03:21,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1043 transitions. [2024-11-07 23:03:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-07 23:03:21,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:21,967 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:21,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 23:03:22,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 23:03:22,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:22,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash 217565898, now seen corresponding path program 1 times [2024-11-07 23:03:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319136761] [2024-11-07 23:03:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:22,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:03:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 23:03:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 23:03:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:22,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:22,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319136761] [2024-11-07 23:03:22,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319136761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 23:03:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771624787] [2024-11-07 23:03:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 23:03:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 23:03:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 23:03:22,692 INFO L87 Difference]: Start difference. First operand 778 states and 1043 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:23,402 INFO L93 Difference]: Finished difference Result 1311 states and 1778 transitions. [2024-11-07 23:03:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:03:23,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2024-11-07 23:03:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:23,406 INFO L225 Difference]: With dead ends: 1311 [2024-11-07 23:03:23,406 INFO L226 Difference]: Without dead ends: 817 [2024-11-07 23:03:23,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:03:23,407 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 28 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:23,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2490 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 23:03:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2024-11-07 23:03:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 796. [2024-11-07 23:03:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 780 states have (on average 1.3397435897435896) internal successors, (1045), 782 states have internal predecessors, (1045), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1069 transitions. [2024-11-07 23:03:23,425 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1069 transitions. Word has length 192 [2024-11-07 23:03:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:23,426 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1069 transitions. [2024-11-07 23:03:23,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1069 transitions. [2024-11-07 23:03:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 23:03:23,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:23,429 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:23,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 23:03:23,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2001197486, now seen corresponding path program 1 times [2024-11-07 23:03:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163401172] [2024-11-07 23:03:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:23,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:03:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 23:03:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:03:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:24,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163401172] [2024-11-07 23:03:24,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163401172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:24,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:24,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 23:03:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837668808] [2024-11-07 23:03:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 23:03:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:24,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 23:03:24,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 23:03:24,023 INFO L87 Difference]: Start difference. First operand 796 states and 1069 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:24,850 INFO L93 Difference]: Finished difference Result 1335 states and 1811 transitions. [2024-11-07 23:03:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 23:03:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-07 23:03:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:24,854 INFO L225 Difference]: With dead ends: 1335 [2024-11-07 23:03:24,854 INFO L226 Difference]: Without dead ends: 827 [2024-11-07 23:03:24,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-07 23:03:24,856 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 35 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:24,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3298 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 23:03:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-07 23:03:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 812. [2024-11-07 23:03:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 796 states have (on average 1.3379396984924623) internal successors, (1065), 798 states have internal predecessors, (1065), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1089 transitions. [2024-11-07 23:03:24,876 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1089 transitions. Word has length 193 [2024-11-07 23:03:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:24,877 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1089 transitions. [2024-11-07 23:03:24,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1089 transitions. [2024-11-07 23:03:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-07 23:03:24,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:24,879 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:24,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 23:03:24,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1090269785, now seen corresponding path program 1 times [2024-11-07 23:03:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:24,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803226617] [2024-11-07 23:03:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:03:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 23:03:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:03:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:25,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803226617] [2024-11-07 23:03:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803226617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:25,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 23:03:25,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 23:03:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712459233] [2024-11-07 23:03:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:25,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 23:03:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:25,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 23:03:25,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 23:03:25,431 INFO L87 Difference]: Start difference. First operand 812 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:26,024 INFO L93 Difference]: Finished difference Result 1343 states and 1818 transitions. [2024-11-07 23:03:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 23:03:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-07 23:03:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:26,029 INFO L225 Difference]: With dead ends: 1343 [2024-11-07 23:03:26,030 INFO L226 Difference]: Without dead ends: 825 [2024-11-07 23:03:26,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 23:03:26,031 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 15 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:26,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2479 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 23:03:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-11-07 23:03:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 818. [2024-11-07 23:03:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 802 states have (on average 1.3354114713216958) internal successors, (1071), 804 states have internal predecessors, (1071), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 23:03:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1095 transitions. [2024-11-07 23:03:26,049 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1095 transitions. Word has length 193 [2024-11-07 23:03:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:26,050 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1095 transitions. [2024-11-07 23:03:26,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1095 transitions. [2024-11-07 23:03:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-07 23:03:26,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:26,052 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:26,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 23:03:26,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:26,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1834389433, now seen corresponding path program 1 times [2024-11-07 23:03:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561676800] [2024-11-07 23:03:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 23:03:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 23:03:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 23:03:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 23:03:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561676800] [2024-11-07 23:03:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561676800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794277660] [2024-11-07 23:03:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:26,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:26,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:26,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:26,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 23:03:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:27,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 23:03:27,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 23:03:27,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 23:03:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794277660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 23:03:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 23:03:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 23:03:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039831594] [2024-11-07 23:03:27,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 23:03:27,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 23:03:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:27,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 23:03:27,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:27,517 INFO L87 Difference]: Start difference. First operand 818 states and 1095 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:27,602 INFO L93 Difference]: Finished difference Result 1546 states and 2086 transitions. [2024-11-07 23:03:27,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 23:03:27,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2024-11-07 23:03:27,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:27,606 INFO L225 Difference]: With dead ends: 1546 [2024-11-07 23:03:27,606 INFO L226 Difference]: Without dead ends: 821 [2024-11-07 23:03:27,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 23:03:27,610 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 445 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:27,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1987 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 23:03:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-07 23:03:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2024-11-07 23:03:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 804 states have (on average 1.335820895522388) internal successors, (1074), 807 states have internal predecessors, (1074), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-07 23:03:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1102 transitions. [2024-11-07 23:03:27,630 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1102 transitions. Word has length 194 [2024-11-07 23:03:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:27,631 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1102 transitions. [2024-11-07 23:03:27,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 23:03:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1102 transitions. [2024-11-07 23:03:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-07 23:03:27,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:27,632 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:27,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 23:03:27,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 23:03:27,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 712142279, now seen corresponding path program 1 times [2024-11-07 23:03:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428290825] [2024-11-07 23:03:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 23:03:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-07 23:03:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 23:03:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 23:03:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428290825] [2024-11-07 23:03:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428290825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763403756] [2024-11-07 23:03:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:28,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:28,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:28,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:28,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 23:03:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:29,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 23:03:29,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 23:03:29,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 23:03:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-07 23:03:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763403756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 23:03:30,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 23:03:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-11-07 23:03:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153619588] [2024-11-07 23:03:30,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 23:03:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 23:03:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 23:03:30,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 23:03:30,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-07 23:03:30,111 INFO L87 Difference]: Start difference. First operand 821 states and 1102 transitions. Second operand has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 23:03:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 23:03:30,583 INFO L93 Difference]: Finished difference Result 1560 states and 2116 transitions. [2024-11-07 23:03:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 23:03:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 198 [2024-11-07 23:03:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 23:03:30,587 INFO L225 Difference]: With dead ends: 1560 [2024-11-07 23:03:30,587 INFO L226 Difference]: Without dead ends: 830 [2024-11-07 23:03:30,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-07 23:03:30,588 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 391 mSDsluCounter, 3900 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 23:03:30,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 4410 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 23:03:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-07 23:03:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2024-11-07 23:03:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 812 states have (on average 1.3374384236453203) internal successors, (1086), 815 states have internal predecessors, (1086), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-07 23:03:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1114 transitions. [2024-11-07 23:03:30,608 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1114 transitions. Word has length 198 [2024-11-07 23:03:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 23:03:30,608 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1114 transitions. [2024-11-07 23:03:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.2) internal successors, (363), 14 states have internal predecessors, (363), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 23:03:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1114 transitions. [2024-11-07 23:03:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-07 23:03:30,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 23:03:30,610 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 23:03:30,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 23:03:30,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 23:03:30,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 23:03:30,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 23:03:30,814 INFO L85 PathProgramCache]: Analyzing trace with hash -273323769, now seen corresponding path program 2 times [2024-11-07 23:03:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 23:03:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067685382] [2024-11-07 23:03:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 23:03:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 23:03:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 23:03:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 23:03:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:32,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 23:03:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 23:03:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 23:03:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-07 23:03:32,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 23:03:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067685382] [2024-11-07 23:03:32,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067685382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 23:03:32,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465758494] [2024-11-07 23:03:32,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 23:03:32,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 23:03:32,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 23:03:32,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 23:03:32,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 23:03:33,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 23:03:33,177 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 23:03:33,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 245 conjuncts are in the unsatisfiable core [2024-11-07 23:03:33,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 23:03:33,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-07 23:03:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-07 23:03:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-07 23:03:33,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-07 23:03:33,944 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-07 23:03:33,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-07 23:03:33,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-07 23:03:33,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-07 23:03:34,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 10 [2024-11-07 23:03:34,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-07 23:03:34,264 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-07 23:03:34,265 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-07 23:03:34,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11