./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.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 da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:43:43,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:43:43,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 14:43:43,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:43:43,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:43:43,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:43:43,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:43:43,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:43:43,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:43:43,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:43:43,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:43:43,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:43:43,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:43:43,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:43:43,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:43:43,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:43:43,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:43:43,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 14:43:43,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:43:43,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 14:43:43,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:43:43,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:43:43,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:43:43,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:43:43,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:43:43,942 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:43:43,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:43:43,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 14:43:43,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:43:43,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:43:43,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:43:43,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:43:43,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:43:43,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:43:43,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:43:43,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:43:43,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:43:43,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:43:43,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:43:43,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:43:43,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:43:43,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:43:43,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:43:43,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:43:43,951 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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-11-09 14:43:44,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:43:44,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:43:44,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:43:44,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:43:44,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:43:44,255 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_test2-2.i [2024-11-09 14:43:45,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:43:46,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:43:46,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-11-09 14:43:46,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d33d2eb/c1a70d52dfdd49268b2d4b146a8889a5/FLAG497ba2393 [2024-11-09 14:43:46,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66d33d2eb/c1a70d52dfdd49268b2d4b146a8889a5 [2024-11-09 14:43:46,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:43:46,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:43:46,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:43:46,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:43:46,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:43:46,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:43:46" (1/1) ... [2024-11-09 14:43:46,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5504b318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:46, skipping insertion in model container [2024-11-09 14:43:46,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:43:46" (1/1) ... [2024-11-09 14:43:46,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:43:47,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:43:47,036 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:43:47,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:43:47,185 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:43:47,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47 WrapperNode [2024-11-09 14:43:47,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:43:47,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:43:47,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:43:47,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:43:47,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,302 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1476 [2024-11-09 14:43:47,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:43:47,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:43:47,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:43:47,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:43:47,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,428 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-09 14:43:47,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:43:47,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:43:47,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:43:47,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:43:47,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (1/1) ... [2024-11-09 14:43:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:43:47,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:43:47,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 14:43:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 14:43:47,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 14:43:47,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 14:43:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 14:43:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 14:43:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 14:43:47,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 14:43:47,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 14:43:47,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 14:43:47,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 14:43:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:43:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:43:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:43:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 14:43:47,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:43:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:43:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:43:47,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:43:47,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:43:47,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:43:49,262 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2024-11-09 14:43:49,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:43:49,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:43:49,296 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 14:43:49,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:43:49 BoogieIcfgContainer [2024-11-09 14:43:49,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:43:49,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:43:49,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:43:49,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:43:49,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:43:46" (1/3) ... [2024-11-09 14:43:49,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de9234f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:43:49, skipping insertion in model container [2024-11-09 14:43:49,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:43:47" (2/3) ... [2024-11-09 14:43:49,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de9234f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:43:49, skipping insertion in model container [2024-11-09 14:43:49,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:43:49" (3/3) ... [2024-11-09 14:43:49,307 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-2.i [2024-11-09 14:43:49,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:43:49,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 14:43:49,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:43:49,398 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;@f8d5a3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:43:49,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 14:43:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 426 states have internal predecessors, (669), 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-09 14:43:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:43:49,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:49,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:49,410 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-09 14:43:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-09 14:43:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156713757] [2024-11-09 14:43:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156713757] [2024-11-09 14:43:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156713757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:43:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802303065] [2024-11-09 14:43:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:49,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:43:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:43:49,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:43:49,662 INFO L87 Difference]: Start difference. First operand has 433 states, 411 states have (on average 1.6277372262773722) internal successors, (669), 426 states have internal predecessors, (669), 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-09 14:43:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:49,739 INFO L93 Difference]: Finished difference Result 862 states and 1380 transitions. [2024-11-09 14:43:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:43:49,741 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-09 14:43:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:49,752 INFO L225 Difference]: With dead ends: 862 [2024-11-09 14:43:49,752 INFO L226 Difference]: Without dead ends: 389 [2024-11-09 14:43:49,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:43:49,760 INFO L432 NwaCegarLoop]: 617 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, 617 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-09 14:43:49,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:43:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-09 14:43:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-09 14:43:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 371 states have (on average 1.4690026954177897) internal successors, (545), 383 states have internal predecessors, (545), 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-09 14:43:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 561 transitions. [2024-11-09 14:43:49,822 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 561 transitions. Word has length 7 [2024-11-09 14:43:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:49,822 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 561 transitions. [2024-11-09 14:43:49,823 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-09 14:43:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 561 transitions. [2024-11-09 14:43:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:43:49,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:49,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:49,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:43:49,824 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-09 14:43:49,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-09 14:43:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269562760] [2024-11-09 14:43:49,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:49,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:43:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570554240] [2024-11-09 14:43:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:49,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:43:49,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:43:49,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 14:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:50,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:43:50,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:43:50,087 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-09 14:43:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:50,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:43:50,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:50,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269562760] [2024-11-09 14:43:50,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:43:50,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570554240] [2024-11-09 14:43:50,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570554240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:50,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:50,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:43:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334448921] [2024-11-09 14:43:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:50,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:43:50,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:43:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:50,136 INFO L87 Difference]: Start difference. First operand 389 states and 561 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-09 14:43:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:50,349 INFO L93 Difference]: Finished difference Result 768 states and 1113 transitions. [2024-11-09 14:43:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:43:50,350 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-09 14:43:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:50,356 INFO L225 Difference]: With dead ends: 768 [2024-11-09 14:43:50,357 INFO L226 Difference]: Without dead ends: 767 [2024-11-09 14:43:50,358 INFO L431 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-09 14:43:50,359 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 530 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:50,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1691 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:43:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-09 14:43:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 394. [2024-11-09 14:43:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 376 states have (on average 1.4654255319148937) internal successors, (551), 388 states have internal predecessors, (551), 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-09 14:43:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 567 transitions. [2024-11-09 14:43:50,393 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 567 transitions. Word has length 7 [2024-11-09 14:43:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:50,394 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 567 transitions. [2024-11-09 14:43:50,394 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-09 14:43:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 567 transitions. [2024-11-09 14:43:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:43:50,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:50,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:50,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 14:43:50,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:50,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 14:43:50,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1002424139, now seen corresponding path program 1 times [2024-11-09 14:43:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703159837] [2024-11-09 14:43:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:43:50,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974828748] [2024-11-09 14:43:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:43:50,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:43:50,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 14:43:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:50,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:43:50,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:43:50,803 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-09 14:43:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:50,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:43:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703159837] [2024-11-09 14:43:50,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:43:50,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974828748] [2024-11-09 14:43:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974828748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:50,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:43:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943074393] [2024-11-09 14:43:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:50,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:43:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:50,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:43:50,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:50,837 INFO L87 Difference]: Start difference. First operand 394 states and 567 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:43:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:51,007 INFO L93 Difference]: Finished difference Result 767 states and 1112 transitions. [2024-11-09 14:43:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:43:51,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 14:43:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:51,014 INFO L225 Difference]: With dead ends: 767 [2024-11-09 14:43:51,014 INFO L226 Difference]: Without dead ends: 766 [2024-11-09 14:43:51,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 14:43:51,017 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 528 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:51,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1696 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:43:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-09 14:43:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 395. [2024-11-09 14:43:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4641909814323608) internal successors, (552), 389 states have internal predecessors, (552), 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-09 14:43:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2024-11-09 14:43:51,046 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 8 [2024-11-09 14:43:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:51,048 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2024-11-09 14:43:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:43:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2024-11-09 14:43:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:43:51,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:51,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:51,068 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-09 14:43:51,253 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,SelfDestructingSolverStorable2 [2024-11-09 14:43:51,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 14:43:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-09 14:43:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987191801] [2024-11-09 14:43:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987191801] [2024-11-09 14:43:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987191801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:51,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:51,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:43:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802731975] [2024-11-09 14:43:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:43:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:51,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:43:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:51,663 INFO L87 Difference]: Start difference. First operand 395 states and 568 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:43:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:51,795 INFO L93 Difference]: Finished difference Result 945 states and 1374 transitions. [2024-11-09 14:43:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:43:51,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-09 14:43:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:51,801 INFO L225 Difference]: With dead ends: 945 [2024-11-09 14:43:51,801 INFO L226 Difference]: Without dead ends: 765 [2024-11-09 14:43:51,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:43:51,803 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 530 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1613 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-09 14:43:51,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1613 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:43:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-09 14:43:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 395. [2024-11-09 14:43:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4615384615384615) internal successors, (551), 389 states have internal predecessors, (551), 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-09 14:43:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 567 transitions. [2024-11-09 14:43:51,822 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 567 transitions. Word has length 64 [2024-11-09 14:43:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:51,823 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 567 transitions. [2024-11-09 14:43:51,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 14:43:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 567 transitions. [2024-11-09 14:43:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 14:43:51,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:51,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:51,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:43:51,829 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-09 14:43:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-09 14:43:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722381339] [2024-11-09 14:43:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:52,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722381339] [2024-11-09 14:43:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722381339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:52,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:43:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817787974] [2024-11-09 14:43:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:52,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:43:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:52,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:43:52,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:52,134 INFO L87 Difference]: Start difference. First operand 395 states and 567 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-09 14:43:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:52,206 INFO L93 Difference]: Finished difference Result 739 states and 1058 transitions. [2024-11-09 14:43:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:43:52,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-09 14:43:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:52,210 INFO L225 Difference]: With dead ends: 739 [2024-11-09 14:43:52,210 INFO L226 Difference]: Without dead ends: 352 [2024-11-09 14:43:52,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:52,212 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 26 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:52,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 909 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:43:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-09 14:43:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2024-11-09 14:43:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 333 states have (on average 1.4174174174174174) internal successors, (472), 345 states have internal predecessors, (472), 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-09 14:43:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 488 transitions. [2024-11-09 14:43:52,224 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 488 transitions. Word has length 81 [2024-11-09 14:43:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:52,224 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 488 transitions. [2024-11-09 14:43:52,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-09 14:43:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 488 transitions. [2024-11-09 14:43:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 14:43:52,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:52,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 14:43:52,228 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-09 14:43:52,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-09 14:43:52,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:52,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201834843] [2024-11-09 14:43:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:52,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:43:52,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:52,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201834843] [2024-11-09 14:43:52,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201834843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:43:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118182998] [2024-11-09 14:43:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:43:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:43:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:43:52,423 INFO L87 Difference]: Start difference. First operand 351 states and 488 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-09 14:43:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:52,498 INFO L93 Difference]: Finished difference Result 931 states and 1314 transitions. [2024-11-09 14:43:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:43:52,498 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-09 14:43:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:52,503 INFO L225 Difference]: With dead ends: 931 [2024-11-09 14:43:52,504 INFO L226 Difference]: Without dead ends: 588 [2024-11-09 14:43:52,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:43:52,505 INFO L432 NwaCegarLoop]: 671 mSDtfsCounter, 277 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:52,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1135 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:43:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-09 14:43:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 584. [2024-11-09 14:43:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 561 states have (on average 1.4367201426024956) internal successors, (806), 578 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 14:43:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 832 transitions. [2024-11-09 14:43:52,526 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 832 transitions. Word has length 81 [2024-11-09 14:43:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:52,527 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 832 transitions. [2024-11-09 14:43:52,527 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-09 14:43:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 832 transitions. [2024-11-09 14:43:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 14:43:52,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:52,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:52,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 14:43:52,531 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-09 14:43:52,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 745765629, now seen corresponding path program 1 times [2024-11-09 14:43:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334252279] [2024-11-09 14:43:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:43:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:43:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:52,703 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-09 14:43:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334252279] [2024-11-09 14:43:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334252279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:43:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497289044] [2024-11-09 14:43:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:52,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:43:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:43:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:52,708 INFO L87 Difference]: Start difference. First operand 584 states and 832 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-09 14:43:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:53,000 INFO L93 Difference]: Finished difference Result 1141 states and 1639 transitions. [2024-11-09 14:43:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:43:53,001 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-09 14:43:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:53,005 INFO L225 Difference]: With dead ends: 1141 [2024-11-09 14:43:53,005 INFO L226 Difference]: Without dead ends: 591 [2024-11-09 14:43:53,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:43:53,007 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 7 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:53,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1315 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:43:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-09 14:43:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-11-09 14:43:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 565 states have (on average 1.4265486725663716) internal successors, (806), 582 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 14:43:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 832 transitions. [2024-11-09 14:43:53,027 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 832 transitions. Word has length 96 [2024-11-09 14:43:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:53,027 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 832 transitions. [2024-11-09 14:43:53,027 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-09 14:43:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 832 transitions. [2024-11-09 14:43:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 14:43:53,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:53,029 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:43:53,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 14:43:53,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 14:43:53,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1863021829, now seen corresponding path program 1 times [2024-11-09 14:43:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:53,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665031888] [2024-11-09 14:43:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:53,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:43:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:43:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:53,399 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-09 14:43:53,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:53,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665031888] [2024-11-09 14:43:53,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665031888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:53,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:43:53,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:43:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059820898] [2024-11-09 14:43:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:43:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:43:53,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:43:53,404 INFO L87 Difference]: Start difference. First operand 588 states and 832 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-09 14:43:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:53,722 INFO L93 Difference]: Finished difference Result 853 states and 1222 transitions. [2024-11-09 14:43:53,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:43:53,723 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-09 14:43:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:53,728 INFO L225 Difference]: With dead ends: 853 [2024-11-09 14:43:53,728 INFO L226 Difference]: Without dead ends: 851 [2024-11-09 14:43:53,729 INFO L431 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-09 14:43:53,730 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 367 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:53,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1727 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 14:43:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-09 14:43:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 652. [2024-11-09 14:43:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 626 states have (on average 1.4121405750798721) internal successors, (884), 643 states have internal predecessors, (884), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 14:43:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 916 transitions. [2024-11-09 14:43:53,754 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 916 transitions. Word has length 96 [2024-11-09 14:43:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:53,755 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 916 transitions. [2024-11-09 14:43:53,755 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-09 14:43:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 916 transitions. [2024-11-09 14:43:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 14:43:53,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:53,756 INFO L215 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-09 14:43:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 14:43:53,756 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-09 14:43:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1868394202, now seen corresponding path program 1 times [2024-11-09 14:43:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469568851] [2024-11-09 14:43:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:43:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:43:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:54,228 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-09 14:43:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:54,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469568851] [2024-11-09 14:43:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469568851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:43:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969205610] [2024-11-09 14:43:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:43:54,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:43:54,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 14:43:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:54,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 14:43:54,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:43:54,557 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-09 14:43:54,576 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-09 14:43:54,593 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-09 14:43:55,417 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-09 14:43:55,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:43:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969205610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:43:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:43:55,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-09 14:43:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914782936] [2024-11-09 14:43:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:43:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 14:43:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:43:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 14:43:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:43:55,420 INFO L87 Difference]: Start difference. First operand 652 states and 916 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-09 14:43:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:43:56,752 INFO L93 Difference]: Finished difference Result 1456 states and 2078 transitions. [2024-11-09 14:43:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:43:56,753 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-09 14:43:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:43:56,757 INFO L225 Difference]: With dead ends: 1456 [2024-11-09 14:43:56,757 INFO L226 Difference]: Without dead ends: 850 [2024-11-09 14:43:56,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-09 14:43:56,759 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 555 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:43:56,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 3083 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 14:43:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-09 14:43:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 652. [2024-11-09 14:43:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 626 states have (on average 1.4105431309904153) internal successors, (883), 643 states have internal predecessors, (883), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 14:43:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 915 transitions. [2024-11-09 14:43:56,780 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 915 transitions. Word has length 102 [2024-11-09 14:43:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:43:56,780 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 915 transitions. [2024-11-09 14:43:56,780 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-09 14:43:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 915 transitions. [2024-11-09 14:43:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 14:43:56,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:43:56,782 INFO L215 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-09 14:43:56,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 14:43:56,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:56,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-09 14:43:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:43:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 338726067, now seen corresponding path program 1 times [2024-11-09 14:43:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:43:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695796136] [2024-11-09 14:43:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:43:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 14:43:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 14:43:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:57,445 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-09 14:43:57,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:43:57,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695796136] [2024-11-09 14:43:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695796136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:43:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690652196] [2024-11-09 14:43:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:43:57,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:43:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:43:57,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:43:57,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 14:43:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:43:57,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 14:43:57,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:45:02,928 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 14:45:09,040 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)