./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:17:28,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:17:28,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:17:28,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:17:28,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:17:28,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:17:28,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:17:28,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:17:28,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:17:28,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:17:28,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:17:28,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:17:28,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:17:28,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:17:28,928 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:17:28,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:17:28,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:17:28,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:17:28,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:17:28,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:17:28,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:17:28,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:17:28,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:17:28,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:17:28,935 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:17:28,935 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:17:28,935 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:17:28,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:17:28,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:17:28,936 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:17:28,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:17:28,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:17:28,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:17:28,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:17:28,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:17:28,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:17:28,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:17:28,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:17:28,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:17:28,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:17:28,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:17:28,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:17:28,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:17:28,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:17:28,941 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c [2024-11-12 20:17:29,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:17:29,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:17:29,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:17:29,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:17:29,242 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:17:29,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2024-11-12 20:17:30,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:17:30,942 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:17:30,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2024-11-12 20:17:30,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3269e248a/4012d8afcd1b4a0082e55be2ed236cb7/FLAG597a1a473 [2024-11-12 20:17:30,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3269e248a/4012d8afcd1b4a0082e55be2ed236cb7 [2024-11-12 20:17:30,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:17:30,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:17:30,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:17:30,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:17:30,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:17:30,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:17:30" (1/1) ... [2024-11-12 20:17:30,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36961f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:30, skipping insertion in model container [2024-11-12 20:17:30,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:17:30" (1/1) ... [2024-11-12 20:17:31,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:17:31,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:17:31,629 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:17:31,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:17:31,767 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:17:31,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31 WrapperNode [2024-11-12 20:17:31,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:17:31,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:17:31,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:17:31,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:17:31,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,885 INFO L138 Inliner]: procedures = 177, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1463 [2024-11-12 20:17:31,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:17:31,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:17:31,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:17:31,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:17:31,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,987 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [219, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-12 20:17:31,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:31,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:17:32,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:17:32,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:17:32,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:17:32,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (1/1) ... [2024-11-12 20:17:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:17:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:17:32,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:17:32,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:17:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 20:17:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 20:17:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:17:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:17:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:17:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:17:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:17:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:17:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:17:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:17:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:17:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:17:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 20:17:32,239 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:17:32,240 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:17:32,240 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 20:17:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:17:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:17:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:17:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:17:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:17:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:17:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:17:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:17:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:17:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:17:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:17:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:17:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:17:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:17:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:17:32,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:17:32,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:17:33,849 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-12 20:17:33,849 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:17:33,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:17:33,873 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 20:17:33,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:17:33 BoogieIcfgContainer [2024-11-12 20:17:33,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:17:33,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:17:33,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:17:33,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:17:33,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:17:30" (1/3) ... [2024-11-12 20:17:33,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1199956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:17:33, skipping insertion in model container [2024-11-12 20:17:33,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:17:31" (2/3) ... [2024-11-12 20:17:33,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1199956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:17:33, skipping insertion in model container [2024-11-12 20:17:33,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:17:33" (3/3) ... [2024-11-12 20:17:33,883 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-1.i [2024-11-12 20:17:33,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:17:33,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-12 20:17:33,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:17:33,989 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;@362e1bae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:17:33,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-12 20:17:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 407 states have (on average 1.628992628992629) internal successors, (663), 422 states have internal predecessors, (663), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 20:17:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:17:34,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:34,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:17:34,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:34,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:34,010 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-12 20:17:34,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:34,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559889921] [2024-11-12 20:17:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:34,210 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-12 20:17:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:34,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559889921] [2024-11-12 20:17:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559889921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:17:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955725102] [2024-11-12 20:17:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:34,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:17:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:17:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:17:34,245 INFO L87 Difference]: Start difference. First operand has 429 states, 407 states have (on average 1.628992628992629) internal successors, (663), 422 states have internal predecessors, (663), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-12 20:17:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:34,327 INFO L93 Difference]: Finished difference Result 854 states and 1368 transitions. [2024-11-12 20:17:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:17:34,329 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-12 20:17:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:34,343 INFO L225 Difference]: With dead ends: 854 [2024-11-12 20:17:34,343 INFO L226 Difference]: Without dead ends: 420 [2024-11-12 20:17:34,349 INFO L434 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-12 20:17:34,352 INFO L435 NwaCegarLoop]: 611 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, 611 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-12 20:17:34,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:17:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-12 20:17:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-12 20:17:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 402 states have (on average 1.4601990049751243) internal successors, (587), 414 states have internal predecessors, (587), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 603 transitions. [2024-11-12 20:17:34,422 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 603 transitions. Word has length 7 [2024-11-12 20:17:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 603 transitions. [2024-11-12 20:17:34,424 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-12 20:17:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 603 transitions. [2024-11-12 20:17:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:17:34,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:34,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:17:34,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:17:34,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:34,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-12 20:17:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:34,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398294092] [2024-11-12 20:17:34,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:17:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890663533] [2024-11-12 20:17:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:34,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:17:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:17:34,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:17:34,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:17:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:34,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:17:34,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:17:34,700 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-12 20:17:34,738 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-12 20:17:34,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:17:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398294092] [2024-11-12 20:17:34,741 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:17:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890663533] [2024-11-12 20:17:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890663533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:34,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:17:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804497637] [2024-11-12 20:17:34,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:17:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:34,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:17:34,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:17:34,747 INFO L87 Difference]: Start difference. First operand 420 states and 603 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:17:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:34,912 INFO L93 Difference]: Finished difference Result 830 states and 1197 transitions. [2024-11-12 20:17:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:17:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:17:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:34,917 INFO L225 Difference]: With dead ends: 830 [2024-11-12 20:17:34,917 INFO L226 Difference]: Without dead ends: 828 [2024-11-12 20:17:34,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12 20:17:34,920 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 571 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:34,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1820 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:17:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-12 20:17:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 426. [2024-11-12 20:17:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 408 states have (on average 1.4558823529411764) internal successors, (594), 420 states have internal predecessors, (594), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 610 transitions. [2024-11-12 20:17:34,960 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 610 transitions. Word has length 7 [2024-11-12 20:17:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:34,961 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 610 transitions. [2024-11-12 20:17:34,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-12 20:17:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 610 transitions. [2024-11-12 20:17:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 20:17:34,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:34,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:17:34,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:17:35,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:17:35,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:35,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash -157664827, now seen corresponding path program 1 times [2024-11-12 20:17:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038061715] [2024-11-12 20:17:35,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:35,365 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-12 20:17:35,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:35,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038061715] [2024-11-12 20:17:35,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038061715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:17:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659634662] [2024-11-12 20:17:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:35,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:17:35,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:17:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:17:35,368 INFO L87 Difference]: Start difference. First operand 426 states and 610 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 20:17:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:35,499 INFO L93 Difference]: Finished difference Result 1038 states and 1500 transitions. [2024-11-12 20:17:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:17:35,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-12 20:17:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:35,504 INFO L225 Difference]: With dead ends: 1038 [2024-11-12 20:17:35,504 INFO L226 Difference]: Without dead ends: 827 [2024-11-12 20:17:35,505 INFO L434 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-12 20:17:35,506 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 572 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:35,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1827 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:17:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-12 20:17:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 426. [2024-11-12 20:17:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 408 states have (on average 1.4534313725490196) internal successors, (593), 420 states have internal predecessors, (593), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 609 transitions. [2024-11-12 20:17:35,520 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 609 transitions. Word has length 10 [2024-11-12 20:17:35,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:35,521 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 609 transitions. [2024-11-12 20:17:35,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-12 20:17:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 609 transitions. [2024-11-12 20:17:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:17:35,524 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:35,524 INFO L218 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] [2024-11-12 20:17:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:17:35,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-12 20:17:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:35,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69998617] [2024-11-12 20:17:35,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:35,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:35,917 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-12 20:17:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69998617] [2024-11-12 20:17:35,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69998617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:35,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:17:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014539016] [2024-11-12 20:17:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:35,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:17:35,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:17:35,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:17:35,923 INFO L87 Difference]: Start difference. First operand 426 states and 609 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 20:17:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:36,021 INFO L93 Difference]: Finished difference Result 802 states and 1144 transitions. [2024-11-12 20:17:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:17:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-12 20:17:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:36,025 INFO L225 Difference]: With dead ends: 802 [2024-11-12 20:17:36,026 INFO L226 Difference]: Without dead ends: 384 [2024-11-12 20:17:36,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:17:36,029 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 12 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:36,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1971 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:17:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-12 20:17:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-12 20:17:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 366 states have (on average 1.4098360655737705) internal successors, (516), 378 states have internal predecessors, (516), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 532 transitions. [2024-11-12 20:17:36,042 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 532 transitions. Word has length 81 [2024-11-12 20:17:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:36,043 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 532 transitions. [2024-11-12 20:17:36,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-12 20:17:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 532 transitions. [2024-11-12 20:17:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 20:17:36,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:36,046 INFO L218 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] [2024-11-12 20:17:36,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:17:36,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1580811434, now seen corresponding path program 1 times [2024-11-12 20:17:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64501680] [2024-11-12 20:17:36,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:36,258 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-12 20:17:36,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:36,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64501680] [2024-11-12 20:17:36,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64501680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:36,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:36,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:17:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730751135] [2024-11-12 20:17:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:36,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:17:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:17:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:17:36,261 INFO L87 Difference]: Start difference. First operand 384 states and 532 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-12 20:17:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:36,377 INFO L93 Difference]: Finished difference Result 1011 states and 1417 transitions. [2024-11-12 20:17:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:17:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2024-11-12 20:17:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:36,381 INFO L225 Difference]: With dead ends: 1011 [2024-11-12 20:17:36,382 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 20:17:36,383 INFO L434 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-12 20:17:36,386 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 297 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:36,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1202 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:17:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 20:17:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 631. [2024-11-12 20:17:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 613 states have (on average 1.4241435562805873) internal successors, (873), 625 states have internal predecessors, (873), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 889 transitions. [2024-11-12 20:17:36,420 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 889 transitions. Word has length 81 [2024-11-12 20:17:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 889 transitions. [2024-11-12 20:17:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-12 20:17:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 889 transitions. [2024-11-12 20:17:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:17:36,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:36,426 INFO L218 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] [2024-11-12 20:17:36,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:17:36,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:36,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1763619839, now seen corresponding path program 1 times [2024-11-12 20:17:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:36,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683273176] [2024-11-12 20:17:36,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:36,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:17:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:17:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:36,657 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-12 20:17:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683273176] [2024-11-12 20:17:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683273176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:17:36,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274077464] [2024-11-12 20:17:36,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:36,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:17:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:17:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:17:36,661 INFO L87 Difference]: Start difference. First operand 631 states and 889 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-12 20:17:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:36,949 INFO L93 Difference]: Finished difference Result 1229 states and 1744 transitions. [2024-11-12 20:17:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:17:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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 96 [2024-11-12 20:17:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:36,953 INFO L225 Difference]: With dead ends: 1229 [2024-11-12 20:17:36,953 INFO L226 Difference]: Without dead ends: 634 [2024-11-12 20:17:36,954 INFO L434 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-12 20:17:36,955 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 7 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:36,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1422 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:17:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-12 20:17:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2024-11-12 20:17:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 613 states have (on average 1.4143556280587275) internal successors, (867), 625 states have internal predecessors, (867), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 20:17:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 883 transitions. [2024-11-12 20:17:36,971 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 883 transitions. Word has length 96 [2024-11-12 20:17:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 883 transitions. [2024-11-12 20:17:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 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-12 20:17:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 883 transitions. [2024-11-12 20:17:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 20:17:36,973 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:36,973 INFO L218 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] [2024-11-12 20:17:36,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:17:36,974 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:36,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -427771013, now seen corresponding path program 1 times [2024-11-12 20:17:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:36,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141659346] [2024-11-12 20:17:36,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:17:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:37,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:17:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:37,361 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-12 20:17:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141659346] [2024-11-12 20:17:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141659346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:37,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:17:37,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:17:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628541958] [2024-11-12 20:17:37,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:37,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:17:37,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:17:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:17:37,364 INFO L87 Difference]: Start difference. First operand 631 states and 883 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12 20:17:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:37,792 INFO L93 Difference]: Finished difference Result 939 states and 1325 transitions. [2024-11-12 20:17:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:17:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 96 [2024-11-12 20:17:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:37,797 INFO L225 Difference]: With dead ends: 939 [2024-11-12 20:17:37,797 INFO L226 Difference]: Without dead ends: 937 [2024-11-12 20:17:37,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12 20:17:37,798 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 409 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:37,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1986 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:17:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-12 20:17:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 695. [2024-11-12 20:17:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 674 states have (on average 1.4020771513353116) internal successors, (945), 686 states have internal predecessors, (945), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 20:17:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 967 transitions. [2024-11-12 20:17:37,816 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 967 transitions. Word has length 96 [2024-11-12 20:17:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:37,817 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 967 transitions. [2024-11-12 20:17:37,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-12 20:17:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 967 transitions. [2024-11-12 20:17:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:17:37,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:37,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-12 20:17:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:17:37,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:37,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:37,819 INFO L85 PathProgramCache]: Analyzing trace with hash 170082138, now seen corresponding path program 1 times [2024-11-12 20:17:37,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:37,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42795230] [2024-11-12 20:17:37,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:37,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:38,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:17:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:17:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:17:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42795230] [2024-11-12 20:17:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42795230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:17:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834722720] [2024-11-12 20:17:38,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:38,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:17:38,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:17:38,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:17:38,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:17:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:38,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:17:38,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:17:38,590 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-12 20:17:38,610 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-12 20:17:38,633 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-12 20:17:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:17:39,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:17:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834722720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:17:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:17:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:17:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266436270] [2024-11-12 20:17:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:17:39,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:17:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:17:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:17:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:17:39,413 INFO L87 Difference]: Start difference. First operand 695 states and 967 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-12 20:17:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:17:41,059 INFO L93 Difference]: Finished difference Result 1585 states and 2233 transitions. [2024-11-12 20:17:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:17:41,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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 102 [2024-11-12 20:17:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:17:41,069 INFO L225 Difference]: With dead ends: 1585 [2024-11-12 20:17:41,070 INFO L226 Difference]: Without dead ends: 936 [2024-11-12 20:17:41,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:17:41,071 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 608 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 3234 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:17:41,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 3234 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 20:17:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-12 20:17:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 695. [2024-11-12 20:17:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 674 states have (on average 1.400593471810089) internal successors, (944), 686 states have internal predecessors, (944), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 20:17:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 966 transitions. [2024-11-12 20:17:41,096 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 966 transitions. Word has length 102 [2024-11-12 20:17:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:17:41,097 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 966 transitions. [2024-11-12 20:17:41,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-12 20:17:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 966 transitions. [2024-11-12 20:17:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 20:17:41,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:17:41,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2024-11-12 20:17:41,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:17:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-12 20:17:41,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-12 20:17:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:17:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1359585997, now seen corresponding path program 1 times [2024-11-12 20:17:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:17:41,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8728555] [2024-11-12 20:17:41,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:17:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:41,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:17:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:17:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:17:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:17:41,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8728555] [2024-11-12 20:17:41,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8728555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:17:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767149962] [2024-11-12 20:17:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:17:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:17:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:17:41,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:17:41,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:17:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:17:42,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 20:17:42,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:18:13,241 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)