./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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_SFH_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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 14:49:48,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:49:48,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 14:49:48,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:49:48,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:49:48,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:49:48,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:49:48,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:49:48,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:49:48,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:49:48,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:49:48,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:49:48,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:49:48,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:49:48,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:49:48,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:49:48,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:49:48,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 14:49:48,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:49:48,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 14:49:48,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:49:48,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:49:48,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:49:48,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:49:48,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:49:48,710 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:49:48,710 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:49:48,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 14:49:48,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:49:48,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:49:48,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:49:48,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:49:48,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:49:48,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:49:48,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:49:48,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:49:48,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:49:48,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:49:48,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:49:48,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:49:48,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:49:48,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:49:48,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:49:48,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:49:48,718 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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-11-09 14:49:48,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:49:48,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:49:48,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:49:48,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:49:48,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:49:48,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-09 14:49:50,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:49:50,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:49:50,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-09 14:49:50,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a840cf6d/8d9a1a7bd22f42bf807db5bc2e443a78/FLAG6e1d19d01 [2024-11-09 14:49:50,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a840cf6d/8d9a1a7bd22f42bf807db5bc2e443a78 [2024-11-09 14:49:50,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:49:50,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:49:50,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:49:50,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:49:50,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:49:50,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:50" (1/1) ... [2024-11-09 14:49:50,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a2d15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:50, skipping insertion in model container [2024-11-09 14:49:50,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:49:50" (1/1) ... [2024-11-09 14:49:50,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:49:51,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:49:51,455 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:49:51,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:49:51,610 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:49:51,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51 WrapperNode [2024-11-09 14:49:51,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:49:51,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:49:51,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:49:51,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:49:51,618 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:49:51" (1/1) ... [2024-11-09 14:49:51,663 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:49:51" (1/1) ... [2024-11-09 14:49:51,729 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1476 [2024-11-09 14:49:51,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:49:51,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:49:51,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:49:51,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:49:51,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,841 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:49:51,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:49:51,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:49:51,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:49:51,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:49:51,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (1/1) ... [2024-11-09 14:49:51,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:49:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:51,974 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:49:51,980 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:49:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 14:49:52,024 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 14:49:52,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 14:49:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 14:49:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 14:49:52,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 14:49:52,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 14:49:52,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 14:49:52,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 14:49:52,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 14:49:52,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:49:52,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:49:52,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:49:52,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:49:52,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:49:52,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:49:52,270 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:49:52,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:49:53,670 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2024-11-09 14:49:53,671 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:49:53,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:49:53,703 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 14:49:53,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:53 BoogieIcfgContainer [2024-11-09 14:49:53,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:49:53,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:49:53,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:49:53,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:49:53,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:49:50" (1/3) ... [2024-11-09 14:49:53,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdd60ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:53, skipping insertion in model container [2024-11-09 14:49:53,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:49:51" (2/3) ... [2024-11-09 14:49:53,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdd60ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:49:53, skipping insertion in model container [2024-11-09 14:49:53,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:49:53" (3/3) ... [2024-11-09 14:49:53,713 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2024-11-09 14:49:53,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:49:53,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-09 14:49:53,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:49:53,821 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;@43e2fe6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:49:53,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 14:49:53,827 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:49:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:49:53,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:53,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:53,836 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:49:53,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-09 14:49:53,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:53,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550243540] [2024-11-09 14:49:53,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:53,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:54,028 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:49:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550243540] [2024-11-09 14:49:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550243540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:49:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045476996] [2024-11-09 14:49:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:54,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:49:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:49:54,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:49:54,067 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:49:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:54,183 INFO L93 Difference]: Finished difference Result 862 states and 1380 transitions. [2024-11-09 14:49:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:49:54,186 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:49:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:54,199 INFO L225 Difference]: With dead ends: 862 [2024-11-09 14:49:54,200 INFO L226 Difference]: Without dead ends: 389 [2024-11-09 14:49:54,207 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:49:54,213 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:49:54,214 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:49:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-09 14:49:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-09 14:49:54,288 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:49:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 561 transitions. [2024-11-09 14:49:54,293 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 561 transitions. Word has length 7 [2024-11-09 14:49:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 561 transitions. [2024-11-09 14:49:54,293 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:49:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 561 transitions. [2024-11-09 14:49:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:49:54,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:54,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:49:54,295 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:49:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-09 14:49:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423156397] [2024-11-09 14:49:54,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:49:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194274385] [2024-11-09 14:49:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:54,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:54,366 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:49:54,368 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:49:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:54,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:49:54,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:49:54,613 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:49:54,671 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:49:54,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:49:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423156397] [2024-11-09 14:49:54,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:49:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194274385] [2024-11-09 14:49:54,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194274385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:54,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:54,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:54,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870833292] [2024-11-09 14:49:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:49:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:49:54,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:49:54,679 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:49:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:54,868 INFO L93 Difference]: Finished difference Result 768 states and 1113 transitions. [2024-11-09 14:49:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:54,870 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:49:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:54,876 INFO L225 Difference]: With dead ends: 768 [2024-11-09 14:49:54,877 INFO L226 Difference]: Without dead ends: 767 [2024-11-09 14:49:54,877 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:49:54,878 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:49:54,880 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:49:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-09 14:49:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 394. [2024-11-09 14:49:54,915 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:49:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 567 transitions. [2024-11-09 14:49:54,917 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 567 transitions. Word has length 7 [2024-11-09 14:49:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:54,918 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 567 transitions. [2024-11-09 14:49:54,918 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:49:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 567 transitions. [2024-11-09 14:49:54,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:49:54,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:54,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:49:54,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 14:49:55,119 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:49:55,120 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:49:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1002424139, now seen corresponding path program 1 times [2024-11-09 14:49:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:55,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627966405] [2024-11-09 14:49:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 14:49:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481878835] [2024-11-09 14:49:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:55,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:55,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:55,152 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:49:55,154 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:49:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:55,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:49:55,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:49:55,315 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:49:55,340 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:49:55,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:49:55,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:55,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627966405] [2024-11-09 14:49:55,340 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 14:49:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481878835] [2024-11-09 14:49:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481878835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379805954] [2024-11-09 14:49:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:55,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:49:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:49:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:49:55,342 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:49:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:55,513 INFO L93 Difference]: Finished difference Result 767 states and 1112 transitions. [2024-11-09 14:49:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:55,514 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:49:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:55,520 INFO L225 Difference]: With dead ends: 767 [2024-11-09 14:49:55,520 INFO L226 Difference]: Without dead ends: 766 [2024-11-09 14:49:55,521 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:49:55,522 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:49:55,524 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:49:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-09 14:49:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 395. [2024-11-09 14:49:55,540 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:49:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2024-11-09 14:49:55,542 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 8 [2024-11-09 14:49:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:55,542 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2024-11-09 14:49:55,542 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:49:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2024-11-09 14:49:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 14:49:55,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:55,545 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:49:55,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 14:49:55,746 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:49:55,746 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:49:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-09 14:49:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520302534] [2024-11-09 14:49:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:56,194 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:49:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520302534] [2024-11-09 14:49:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520302534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:49:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396908925] [2024-11-09 14:49:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:56,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:49:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:49:56,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:49:56,197 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:49:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:56,324 INFO L93 Difference]: Finished difference Result 945 states and 1374 transitions. [2024-11-09 14:49:56,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:56,324 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:49:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:56,328 INFO L225 Difference]: With dead ends: 945 [2024-11-09 14:49:56,328 INFO L226 Difference]: Without dead ends: 765 [2024-11-09 14:49:56,329 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:49:56,329 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:49:56,330 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:49:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-09 14:49:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 395. [2024-11-09 14:49:56,343 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:49:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 567 transitions. [2024-11-09 14:49:56,345 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 567 transitions. Word has length 64 [2024-11-09 14:49:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:56,345 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 567 transitions. [2024-11-09 14:49:56,346 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:49:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 567 transitions. [2024-11-09 14:49:56,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 14:49:56,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:56,352 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:49:56,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 14:49:56,353 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:49:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-09 14:49:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:56,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892743217] [2024-11-09 14:49:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:56,670 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:49:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892743217] [2024-11-09 14:49:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892743217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:49:56,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745228517] [2024-11-09 14:49:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:56,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:49:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:49:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:49:56,676 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:49:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:56,752 INFO L93 Difference]: Finished difference Result 739 states and 1058 transitions. [2024-11-09 14:49:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:56,753 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:49:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:56,758 INFO L225 Difference]: With dead ends: 739 [2024-11-09 14:49:56,758 INFO L226 Difference]: Without dead ends: 352 [2024-11-09 14:49:56,759 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:49:56,760 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 26 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:49:56,760 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:49:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-09 14:49:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2024-11-09 14:49:56,769 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:49:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 488 transitions. [2024-11-09 14:49:56,771 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 488 transitions. Word has length 81 [2024-11-09 14:49:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:56,773 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 488 transitions. [2024-11-09 14:49:56,773 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:49:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 488 transitions. [2024-11-09 14:49:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 14:49:56,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:56,778 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:49:56,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 14:49:56,779 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:49:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-09 14:49:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:56,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607246239] [2024-11-09 14:49:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:56,958 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:49:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:56,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607246239] [2024-11-09 14:49:56,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607246239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:56,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:56,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:49:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314349534] [2024-11-09 14:49:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:56,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:49:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:49:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:49:56,964 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:49:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:57,039 INFO L93 Difference]: Finished difference Result 931 states and 1314 transitions. [2024-11-09 14:49:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:49:57,039 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:49:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:57,044 INFO L225 Difference]: With dead ends: 931 [2024-11-09 14:49:57,044 INFO L226 Difference]: Without dead ends: 588 [2024-11-09 14:49:57,045 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:49:57,046 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:49:57,048 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:49:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-09 14:49:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 584. [2024-11-09 14:49:57,066 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:49:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 832 transitions. [2024-11-09 14:49:57,069 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 832 transitions. Word has length 81 [2024-11-09 14:49:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:57,069 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 832 transitions. [2024-11-09 14:49:57,069 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:49:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 832 transitions. [2024-11-09 14:49:57,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 14:49:57,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:57,072 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:49:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 14:49:57,073 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:49:57,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 745765629, now seen corresponding path program 1 times [2024-11-09 14:49:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493379296] [2024-11-09 14:49:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:49:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:49:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,261 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:49:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493379296] [2024-11-09 14:49:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493379296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:49:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205506839] [2024-11-09 14:49:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:49:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:49:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:49:57,266 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:49:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:57,538 INFO L93 Difference]: Finished difference Result 1141 states and 1639 transitions. [2024-11-09 14:49:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:49:57,539 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:49:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:57,542 INFO L225 Difference]: With dead ends: 1141 [2024-11-09 14:49:57,542 INFO L226 Difference]: Without dead ends: 591 [2024-11-09 14:49:57,543 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:49:57,544 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:49:57,544 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:49:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-09 14:49:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2024-11-09 14:49:57,562 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:49:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 832 transitions. [2024-11-09 14:49:57,565 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 832 transitions. Word has length 96 [2024-11-09 14:49:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:57,567 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 832 transitions. [2024-11-09 14:49:57,567 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:49:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 832 transitions. [2024-11-09 14:49:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 14:49:57,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:57,570 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:49:57,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 14:49:57,571 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:49:57,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1863021829, now seen corresponding path program 1 times [2024-11-09 14:49:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111285522] [2024-11-09 14:49:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:49:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:49:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:57,987 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:49:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111285522] [2024-11-09 14:49:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111285522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:49:57,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:49:57,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:49:57,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250282230] [2024-11-09 14:49:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:49:57,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:49:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:49:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:49:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:49:57,990 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:49:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:49:58,320 INFO L93 Difference]: Finished difference Result 853 states and 1222 transitions. [2024-11-09 14:49:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:49:58,321 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:49:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:49:58,326 INFO L225 Difference]: With dead ends: 853 [2024-11-09 14:49:58,326 INFO L226 Difference]: Without dead ends: 851 [2024-11-09 14:49:58,326 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:49:58,327 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:49:58,327 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:49:58,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-09 14:49:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 652. [2024-11-09 14:49:58,359 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:49:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 916 transitions. [2024-11-09 14:49:58,362 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 916 transitions. Word has length 96 [2024-11-09 14:49:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:49:58,363 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 916 transitions. [2024-11-09 14:49:58,364 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:49:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 916 transitions. [2024-11-09 14:49:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 14:49:58,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:49:58,366 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:49:58,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 14:49:58,366 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:49:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:49:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1868394202, now seen corresponding path program 1 times [2024-11-09 14:49:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:49:58,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491220914] [2024-11-09 14:49:58,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:49:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 14:49:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 14:49:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:58,789 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:49:58,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:49:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491220914] [2024-11-09 14:49:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491220914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:49:58,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704236455] [2024-11-09 14:49:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:49:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:49:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:49:58,791 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:49:58,793 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:49:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:49:59,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 14:49:59,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:49:59,145 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:49:59,169 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:49:59,188 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:50:00,009 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:50:00,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:50:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704236455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:50:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:50:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-09 14:50:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950122298] [2024-11-09 14:50:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:50:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 14:50:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:50:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 14:50:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:50:00,011 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:50:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:50:01,373 INFO L93 Difference]: Finished difference Result 1456 states and 2078 transitions. [2024-11-09 14:50:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 14:50:01,377 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:50:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:50:01,381 INFO L225 Difference]: With dead ends: 1456 [2024-11-09 14:50:01,381 INFO L226 Difference]: Without dead ends: 850 [2024-11-09 14:50:01,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-09 14:50:01,386 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:50:01,386 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:50:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-09 14:50:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 652. [2024-11-09 14:50:01,404 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:50:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 915 transitions. [2024-11-09 14:50:01,407 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 915 transitions. Word has length 102 [2024-11-09 14:50:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:50:01,407 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 915 transitions. [2024-11-09 14:50:01,408 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:50:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 915 transitions. [2024-11-09 14:50:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 14:50:01,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:50:01,409 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:50:01,429 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:50:01,612 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:50:01,613 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:50:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:50:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 338726067, now seen corresponding path program 1 times [2024-11-09 14:50:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:50:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059838264] [2024-11-09 14:50:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:50:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:50:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:50:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 14:50:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:50:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 14:50:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:50:02,106 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:50:02,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:50:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059838264] [2024-11-09 14:50:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059838264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:50:02,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559068576] [2024-11-09 14:50:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:50:02,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:50:02,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:50:02,109 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:50:02,111 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:50:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:50:02,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 14:50:02,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:50:24,133 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 14:50:41,072 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)