./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:20:56,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:20:56,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:20:56,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:20:56,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:20:56,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:20:56,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:20:56,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:20:56,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:20:56,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:20:56,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:20:56,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:20:56,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:20:56,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:20:56,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:20:56,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:20:56,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:20:56,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:20:56,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:20:56,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:20:56,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:20:56,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:20:56,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:20:56,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:20:56,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:20:56,144 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:20:56,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:20:56,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:20:56,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:20:56,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:20:56,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:20:56,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:20:56,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:20:56,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:20:56,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:56,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:20:56,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:20:56,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:20:56,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:20:56,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:20:56,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:20:56,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:20:56,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:20:56,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:20:56,149 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-12 20:20:56,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:20:56,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:20:56,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:20:56,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:20:56,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:20:56,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-12 20:20:57,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:20:57,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:20:57,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-12 20:20:58,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa19d4b5/1b89fb9d55304c7cbd3fa87f3190d205/FLAG2c9fe5604 [2024-11-12 20:20:58,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aa19d4b5/1b89fb9d55304c7cbd3fa87f3190d205 [2024-11-12 20:20:58,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:20:58,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:20:58,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:58,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:20:58,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:20:58,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f180dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58, skipping insertion in model container [2024-11-12 20:20:58,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:20:58,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:58,671 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:20:58,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:58,852 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:20:58,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58 WrapperNode [2024-11-12 20:20:58,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:58,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:58,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:20:58,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:20:58,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,973 INFO L138 Inliner]: procedures = 282, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1657 [2024-11-12 20:20:58,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:58,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:20:58,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:20:58,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:20:58,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:58,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,091 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-12 20:20:59,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:20:59,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:20:59,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:20:59,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:20:59,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (1/1) ... [2024-11-12 20:20:59,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:59,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:20:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 20:20:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:20:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 20:20:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:20:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-12 20:20:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:20:59,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:20:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-12 20:20:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-12 20:20:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-12 20:20:59,260 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:20:59,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 20:20:59,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:20:59,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:20:59,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:20:59,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:21:00,540 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2024-11-12 20:21:00,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:21:00,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:21:00,563 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-12 20:21:00,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:21:00 BoogieIcfgContainer [2024-11-12 20:21:00,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:21:00,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:21:00,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:21:00,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:21:00,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:20:58" (1/3) ... [2024-11-12 20:21:00,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bab558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:21:00, skipping insertion in model container [2024-11-12 20:21:00,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:58" (2/3) ... [2024-11-12 20:21:00,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23bab558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:21:00, skipping insertion in model container [2024-11-12 20:21:00,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:21:00" (3/3) ... [2024-11-12 20:21:00,573 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-12 20:21:00,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:21:00,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-12 20:21:00,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:21:00,680 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;@36021633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:21:00,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-12 20:21:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 501 states, 462 states have (on average 1.606060606060606) internal successors, (742), 479 states have internal predecessors, (742), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 20:21:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 20:21:00,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:00,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:00,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:00,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1635847084, now seen corresponding path program 1 times [2024-11-12 20:21:00,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:00,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604645506] [2024-11-12 20:21:00,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604645506] [2024-11-12 20:21:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604645506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:21:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062196471] [2024-11-12 20:21:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:00,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:21:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:21:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:21:00,997 INFO L87 Difference]: Start difference. First operand has 501 states, 462 states have (on average 1.606060606060606) internal successors, (742), 479 states have internal predecessors, (742), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-12 20:21:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:01,056 INFO L93 Difference]: Finished difference Result 995 states and 1569 transitions. [2024-11-12 20:21:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:21:01,058 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-12 20:21:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:01,067 INFO L225 Difference]: With dead ends: 995 [2024-11-12 20:21:01,067 INFO L226 Difference]: Without dead ends: 487 [2024-11-12 20:21:01,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:21:01,073 INFO L435 NwaCegarLoop]: 695 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, 695 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:01,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:21:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-12 20:21:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2024-11-12 20:21:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 454 states have (on average 1.4383259911894273) internal successors, (653), 468 states have internal predecessors, (653), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:21:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 683 transitions. [2024-11-12 20:21:01,124 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 683 transitions. Word has length 8 [2024-11-12 20:21:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:01,125 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 683 transitions. [2024-11-12 20:21:01,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-12 20:21:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 683 transitions. [2024-11-12 20:21:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 20:21:01,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:01,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:01,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:21:01,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:01,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1635849006, now seen corresponding path program 1 times [2024-11-12 20:21:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:01,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454122159] [2024-11-12 20:21:01,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:01,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:21:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740293346] [2024-11-12 20:21:01,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:01,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:01,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:01,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:01,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:21:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:01,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:21:01,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:01,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:01,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:01,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454122159] [2024-11-12 20:21:01,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:21:01,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740293346] [2024-11-12 20:21:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740293346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:01,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:21:01,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50338497] [2024-11-12 20:21:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:01,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:21:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:01,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:21:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:21:01,463 INFO L87 Difference]: Start difference. First operand 487 states and 683 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-12 20:21:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:01,638 INFO L93 Difference]: Finished difference Result 940 states and 1333 transitions. [2024-11-12 20:21:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:21:01,639 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-12 20:21:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:01,645 INFO L225 Difference]: With dead ends: 940 [2024-11-12 20:21:01,645 INFO L226 Difference]: Without dead ends: 938 [2024-11-12 20:21:01,646 INFO L434 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-12 20:21:01,647 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 614 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:01,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1961 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-12 20:21:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 494. [2024-11-12 20:21:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4338394793926248) internal successors, (661), 475 states have internal predecessors, (661), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:21:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 691 transitions. [2024-11-12 20:21:01,680 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 691 transitions. Word has length 8 [2024-11-12 20:21:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:01,680 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 691 transitions. [2024-11-12 20:21:01,680 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-12 20:21:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 691 transitions. [2024-11-12 20:21:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 20:21:01,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:01,682 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:01,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:21:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:01,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1086501261, now seen corresponding path program 1 times [2024-11-12 20:21:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593825332] [2024-11-12 20:21:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-12 20:21:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 20:21:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-12 20:21:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 20:21:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593825332] [2024-11-12 20:21:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593825332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:21:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895000038] [2024-11-12 20:21:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:02,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:21:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:21:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:21:02,104 INFO L87 Difference]: Start difference. First operand 494 states and 691 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 20:21:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:02,193 INFO L93 Difference]: Finished difference Result 1192 states and 1688 transitions. [2024-11-12 20:21:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:21:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-12 20:21:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:02,197 INFO L225 Difference]: With dead ends: 1192 [2024-11-12 20:21:02,200 INFO L226 Difference]: Without dead ends: 937 [2024-11-12 20:21:02,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:21:02,202 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 616 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:02,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 2000 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-12 20:21:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 494. [2024-11-12 20:21:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4316702819956617) internal successors, (660), 475 states have internal predecessors, (660), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:21:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 690 transitions. [2024-11-12 20:21:02,247 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 690 transitions. Word has length 34 [2024-11-12 20:21:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:02,247 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 690 transitions. [2024-11-12 20:21:02,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 20:21:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 690 transitions. [2024-11-12 20:21:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:21:02,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:02,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:02,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:21:02,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:02,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 185612591, now seen corresponding path program 1 times [2024-11-12 20:21:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298469020] [2024-11-12 20:21:02,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:02,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:02,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298469020] [2024-11-12 20:21:02,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298469020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:02,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:02,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:21:02,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942768727] [2024-11-12 20:21:02,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:02,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:21:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:02,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:21:02,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:21:02,500 INFO L87 Difference]: Start difference. First operand 494 states and 690 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:02,555 INFO L93 Difference]: Finished difference Result 982 states and 1374 transitions. [2024-11-12 20:21:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:21:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-12 20:21:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:02,557 INFO L225 Difference]: With dead ends: 982 [2024-11-12 20:21:02,557 INFO L226 Difference]: Without dead ends: 497 [2024-11-12 20:21:02,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:21:02,559 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 105 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:02,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1872 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:21:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-12 20:21:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 494. [2024-11-12 20:21:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 461 states have (on average 1.4164859002169197) internal successors, (653), 475 states have internal predecessors, (653), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:21:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 683 transitions. [2024-11-12 20:21:02,567 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 683 transitions. Word has length 64 [2024-11-12 20:21:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:02,567 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 683 transitions. [2024-11-12 20:21:02,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 683 transitions. [2024-11-12 20:21:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:21:02,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:02,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:02,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:21:02,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:02,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:02,569 INFO L85 PathProgramCache]: Analyzing trace with hash -878587357, now seen corresponding path program 1 times [2024-11-12 20:21:02,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372647138] [2024-11-12 20:21:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372647138] [2024-11-12 20:21:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372647138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:02,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:02,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:21:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145769803] [2024-11-12 20:21:02,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:21:02,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:02,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:21:02,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:21:02,682 INFO L87 Difference]: Start difference. First operand 494 states and 683 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:02,719 INFO L93 Difference]: Finished difference Result 909 states and 1268 transitions. [2024-11-12 20:21:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:21:02,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-12 20:21:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:02,724 INFO L225 Difference]: With dead ends: 909 [2024-11-12 20:21:02,724 INFO L226 Difference]: Without dead ends: 905 [2024-11-12 20:21:02,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:21:02,725 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 516 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:02,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 2008 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:21:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-12 20:21:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 897. [2024-11-12 20:21:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 856 states have (on average 1.425233644859813) internal successors, (1220), 872 states have internal predecessors, (1220), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (22), 18 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 20:21:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1264 transitions. [2024-11-12 20:21:02,740 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1264 transitions. Word has length 64 [2024-11-12 20:21:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:02,740 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1264 transitions. [2024-11-12 20:21:02,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1264 transitions. [2024-11-12 20:21:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 20:21:02,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:02,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:21:02,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -240672312, now seen corresponding path program 1 times [2024-11-12 20:21:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:02,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635585282] [2024-11-12 20:21:02,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:02,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635585282] [2024-11-12 20:21:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635585282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:21:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752375691] [2024-11-12 20:21:02,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:21:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:21:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:21:02,951 INFO L87 Difference]: Start difference. First operand 897 states and 1264 transitions. Second operand has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 20:21:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:03,105 INFO L93 Difference]: Finished difference Result 1171 states and 1640 transitions. [2024-11-12 20:21:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:21:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-12 20:21:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:03,110 INFO L225 Difference]: With dead ends: 1171 [2024-11-12 20:21:03,110 INFO L226 Difference]: Without dead ends: 1169 [2024-11-12 20:21:03,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:21:03,111 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 572 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:03,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1923 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2024-11-12 20:21:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1159. [2024-11-12 20:21:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1105 states have (on average 1.4244343891402715) internal successors, (1574), 1122 states have internal predecessors, (1574), 32 states have call successors, (32), 10 states have call predecessors, (32), 8 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 20:21:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1638 transitions. [2024-11-12 20:21:03,140 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1638 transitions. Word has length 74 [2024-11-12 20:21:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:03,140 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1638 transitions. [2024-11-12 20:21:03,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 20:21:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1638 transitions. [2024-11-12 20:21:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 20:21:03,142 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:03,142 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 20:21:03,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:21:03,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:03,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash 980932139, now seen corresponding path program 1 times [2024-11-12 20:21:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474129655] [2024-11-12 20:21:03,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:03,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:03,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474129655] [2024-11-12 20:21:03,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474129655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:03,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551375987] [2024-11-12 20:21:03,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:03,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:03,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:21:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:03,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:21:03,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:03,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551375987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-12 20:21:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621067778] [2024-11-12 20:21:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:21:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:21:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:21:03,692 INFO L87 Difference]: Start difference. First operand 1159 states and 1638 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 20:21:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:03,751 INFO L93 Difference]: Finished difference Result 1576 states and 2224 transitions. [2024-11-12 20:21:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:21:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-12 20:21:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:03,756 INFO L225 Difference]: With dead ends: 1576 [2024-11-12 20:21:03,756 INFO L226 Difference]: Without dead ends: 1575 [2024-11-12 20:21:03,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:21:03,757 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 636 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2589 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:03,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 2589 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:21:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-12 20:21:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1525. [2024-11-12 20:21:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1464 states have (on average 1.4296448087431695) internal successors, (2093), 1483 states have internal predecessors, (2093), 37 states have call successors, (37), 13 states have call predecessors, (37), 10 states have return successors, (37), 30 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 20:21:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2167 transitions. [2024-11-12 20:21:03,788 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2167 transitions. Word has length 83 [2024-11-12 20:21:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:03,788 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2167 transitions. [2024-11-12 20:21:03,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 20:21:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2167 transitions. [2024-11-12 20:21:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 20:21:03,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:03,789 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 20:21:03,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:21:03,989 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,SelfDestructingSolverStorable6 [2024-11-12 20:21:03,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash 344125278, now seen corresponding path program 1 times [2024-11-12 20:21:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151392912] [2024-11-12 20:21:03,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:04,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:04,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151392912] [2024-11-12 20:21:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151392912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824934609] [2024-11-12 20:21:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:04,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:04,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:04,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:04,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:21:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:04,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 20:21:04,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:04,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824934609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:21:04,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:21:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-11-12 20:21:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461609705] [2024-11-12 20:21:04,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:21:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 20:21:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 20:21:04,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-12 20:21:04,746 INFO L87 Difference]: Start difference. First operand 1525 states and 2167 transitions. Second operand has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 20:21:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:06,345 INFO L93 Difference]: Finished difference Result 4158 states and 5901 transitions. [2024-11-12 20:21:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-12 20:21:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 84 [2024-11-12 20:21:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:06,357 INFO L225 Difference]: With dead ends: 4158 [2024-11-12 20:21:06,357 INFO L226 Difference]: Without dead ends: 4156 [2024-11-12 20:21:06,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=1350, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 20:21:06,358 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 5941 mSDsluCounter, 11594 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5966 SdHoareTripleChecker+Valid, 12314 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:06,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5966 Valid, 12314 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 20:21:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2024-11-12 20:21:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 3179. [2024-11-12 20:21:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3059 states have (on average 1.4233409610983982) internal successors, (4354), 3080 states have internal predecessors, (4354), 83 states have call successors, (83), 28 states have call predecessors, (83), 23 states have return successors, (106), 70 states have call predecessors, (106), 83 states have call successors, (106) [2024-11-12 20:21:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4543 transitions. [2024-11-12 20:21:06,419 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4543 transitions. Word has length 84 [2024-11-12 20:21:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:06,419 INFO L471 AbstractCegarLoop]: Abstraction has 3179 states and 4543 transitions. [2024-11-12 20:21:06,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 12.555555555555555) internal successors, (226), 15 states have internal predecessors, (226), 5 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 20:21:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4543 transitions. [2024-11-12 20:21:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 20:21:06,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:06,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:06,433 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-12 20:21:06,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:06,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:06,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1558756002, now seen corresponding path program 1 times [2024-11-12 20:21:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320189255] [2024-11-12 20:21:06,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:06,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320189255] [2024-11-12 20:21:06,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320189255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:06,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:06,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:21:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080827069] [2024-11-12 20:21:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:06,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:21:06,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:21:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:21:06,709 INFO L87 Difference]: Start difference. First operand 3179 states and 4543 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:06,878 INFO L93 Difference]: Finished difference Result 6616 states and 9488 transitions. [2024-11-12 20:21:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:21:06,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2024-11-12 20:21:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:06,888 INFO L225 Difference]: With dead ends: 6616 [2024-11-12 20:21:06,889 INFO L226 Difference]: Without dead ends: 3446 [2024-11-12 20:21:06,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:21:06,893 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 420 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:06,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1545 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2024-11-12 20:21:06,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3332. [2024-11-12 20:21:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 3218 states have (on average 1.4334990677439403) internal successors, (4613), 3238 states have internal predecessors, (4613), 80 states have call successors, (80), 24 states have call predecessors, (80), 20 states have return successors, (102), 69 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-12 20:21:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4795 transitions. [2024-11-12 20:21:06,975 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4795 transitions. Word has length 82 [2024-11-12 20:21:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:06,975 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4795 transitions. [2024-11-12 20:21:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:21:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4795 transitions. [2024-11-12 20:21:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 20:21:06,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:06,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 20:21:06,977 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting alt_bzeroErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1908045712, now seen corresponding path program 1 times [2024-11-12 20:21:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199624888] [2024-11-12 20:21:06,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 20:21:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 20:21:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199624888] [2024-11-12 20:21:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199624888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537717928] [2024-11-12 20:21:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:07,197 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-12 20:21:07,200 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-12 20:21:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:07,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:21:07,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:07,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 20:21:07,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537717928] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:07,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:21:07,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 13 [2024-11-12 20:21:07,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126207161] [2024-11-12 20:21:07,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:07,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:21:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:07,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:21:07,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:21:07,701 INFO L87 Difference]: Start difference. First operand 3332 states and 4795 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:21:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:07,818 INFO L93 Difference]: Finished difference Result 3332 states and 4795 transitions. [2024-11-12 20:21:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:21:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 93 [2024-11-12 20:21:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:07,826 INFO L225 Difference]: With dead ends: 3332 [2024-11-12 20:21:07,826 INFO L226 Difference]: Without dead ends: 3331 [2024-11-12 20:21:07,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:21:07,827 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 1816 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:07,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 671 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2024-11-12 20:21:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2024-11-12 20:21:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3218 states have (on average 1.4319453076444997) internal successors, (4608), 3237 states have internal predecessors, (4608), 80 states have call successors, (80), 24 states have call predecessors, (80), 20 states have return successors, (102), 69 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-12 20:21:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4790 transitions. [2024-11-12 20:21:07,884 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4790 transitions. Word has length 93 [2024-11-12 20:21:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 4790 transitions. [2024-11-12 20:21:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 20:21:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4790 transitions. [2024-11-12 20:21:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 20:21:07,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:07,885 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2024-11-12 20:21:07,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 20:21:08,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:08,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting alt_bzeroErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:08,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 980125141, now seen corresponding path program 1 times [2024-11-12 20:21:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584038899] [2024-11-12 20:21:08,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 20:21:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 20:21:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584038899] [2024-11-12 20:21:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584038899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033736127] [2024-11-12 20:21:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:08,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:08,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 20:21:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:08,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:21:08,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:08,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 20:21:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033736127] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:21:08,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:21:08,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 13 [2024-11-12 20:21:08,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465900802] [2024-11-12 20:21:08,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:21:08,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 20:21:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:08,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 20:21:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:21:08,877 INFO L87 Difference]: Start difference. First operand 3331 states and 4790 transitions. Second operand has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 20:21:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:09,559 INFO L93 Difference]: Finished difference Result 6509 states and 9324 transitions. [2024-11-12 20:21:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 20:21:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 94 [2024-11-12 20:21:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:09,575 INFO L225 Difference]: With dead ends: 6509 [2024-11-12 20:21:09,575 INFO L226 Difference]: Without dead ends: 6508 [2024-11-12 20:21:09,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=471, Unknown=0, NotChecked=0, Total=702 [2024-11-12 20:21:09,578 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 2496 mSDsluCounter, 4912 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 5546 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:09,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 5546 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:21:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2024-11-12 20:21:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6070. [2024-11-12 20:21:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6070 states, 5848 states have (on average 1.427325581395349) internal successors, (8347), 5872 states have internal predecessors, (8347), 159 states have call successors, (159), 56 states have call predecessors, (159), 50 states have return successors, (197), 141 states have call predecessors, (197), 159 states have call successors, (197) [2024-11-12 20:21:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6070 states to 6070 states and 8703 transitions. [2024-11-12 20:21:09,745 INFO L78 Accepts]: Start accepts. Automaton has 6070 states and 8703 transitions. Word has length 94 [2024-11-12 20:21:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:09,746 INFO L471 AbstractCegarLoop]: Abstraction has 6070 states and 8703 transitions. [2024-11-12 20:21:09,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 18.076923076923077) internal successors, (235), 12 states have internal predecessors, (235), 5 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 20:21:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6070 states and 8703 transitions. [2024-11-12 20:21:09,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 20:21:09,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:09,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:09,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 20:21:09,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 20:21:09,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:09,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2083756214, now seen corresponding path program 1 times [2024-11-12 20:21:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440864846] [2024-11-12 20:21:09,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 20:21:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 20:21:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 20:21:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440864846] [2024-11-12 20:21:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440864846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:21:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899586482] [2024-11-12 20:21:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:21:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:10,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:21:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:21:10,210 INFO L87 Difference]: Start difference. First operand 6070 states and 8703 transitions. Second operand has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:21:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:10,860 INFO L93 Difference]: Finished difference Result 8326 states and 11950 transitions. [2024-11-12 20:21:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:21:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 120 [2024-11-12 20:21:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:10,894 INFO L225 Difference]: With dead ends: 8326 [2024-11-12 20:21:10,894 INFO L226 Difference]: Without dead ends: 8324 [2024-11-12 20:21:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:21:10,898 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 564 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:10,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 2917 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:21:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2024-11-12 20:21:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 6238. [2024-11-12 20:21:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6238 states, 6007 states have (on average 1.4225070750790745) internal successors, (8545), 6032 states have internal predecessors, (8545), 168 states have call successors, (168), 56 states have call predecessors, (168), 50 states have return successors, (209), 149 states have call predecessors, (209), 168 states have call successors, (209) [2024-11-12 20:21:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6238 states to 6238 states and 8922 transitions. [2024-11-12 20:21:11,109 INFO L78 Accepts]: Start accepts. Automaton has 6238 states and 8922 transitions. Word has length 120 [2024-11-12 20:21:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:11,110 INFO L471 AbstractCegarLoop]: Abstraction has 6238 states and 8922 transitions. [2024-11-12 20:21:11,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:21:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6238 states and 8922 transitions. [2024-11-12 20:21:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-12 20:21:11,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:11,112 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-12 20:21:11,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 20:21:11,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:11,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1429916002, now seen corresponding path program 1 times [2024-11-12 20:21:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:11,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137288514] [2024-11-12 20:21:11,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:21:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 20:21:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 20:21:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 20:21:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137288514] [2024-11-12 20:21:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137288514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001199645] [2024-11-12 20:21:11,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:11,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:11,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:11,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 20:21:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:11,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 20:21:11,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 20:21:11,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001199645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:11,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:11,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-12 20:21:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94068069] [2024-11-12 20:21:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:11,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:21:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:11,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:21:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:21:11,840 INFO L87 Difference]: Start difference. First operand 6238 states and 8922 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:21:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:12,030 INFO L93 Difference]: Finished difference Result 11822 states and 16948 transitions. [2024-11-12 20:21:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 20:21:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-11-12 20:21:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:12,041 INFO L225 Difference]: With dead ends: 11822 [2024-11-12 20:21:12,042 INFO L226 Difference]: Without dead ends: 5988 [2024-11-12 20:21:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:21:12,049 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 161 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:12,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 3174 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2024-11-12 20:21:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 5988. [2024-11-12 20:21:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5988 states, 5774 states have (on average 1.4255282299965362) internal successors, (8231), 5797 states have internal predecessors, (8231), 157 states have call successors, (157), 50 states have call predecessors, (157), 44 states have return successors, (192), 140 states have call predecessors, (192), 157 states have call successors, (192) [2024-11-12 20:21:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5988 states to 5988 states and 8580 transitions. [2024-11-12 20:21:12,150 INFO L78 Accepts]: Start accepts. Automaton has 5988 states and 8580 transitions. Word has length 127 [2024-11-12 20:21:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:12,151 INFO L471 AbstractCegarLoop]: Abstraction has 5988 states and 8580 transitions. [2024-11-12 20:21:12,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:21:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5988 states and 8580 transitions. [2024-11-12 20:21:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 20:21:12,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:12,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:12,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 20:21:12,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:12,356 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:12,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2038802715, now seen corresponding path program 1 times [2024-11-12 20:21:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:12,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302919535] [2024-11-12 20:21:12,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:21:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 20:21:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 20:21:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 20:21:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 20:21:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302919535] [2024-11-12 20:21:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302919535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333273289] [2024-11-12 20:21:12,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:12,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:12,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 20:21:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:13,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:21:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:13,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:13,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:13,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 20:21:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 20:21:13,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333273289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:13,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:13,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2024-11-12 20:21:13,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565062533] [2024-11-12 20:21:13,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:13,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:21:13,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:21:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-12 20:21:13,695 INFO L87 Difference]: Start difference. First operand 5988 states and 8580 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:15,443 INFO L93 Difference]: Finished difference Result 14022 states and 20117 transitions. [2024-11-12 20:21:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:21:15,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 132 [2024-11-12 20:21:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:15,461 INFO L225 Difference]: With dead ends: 14022 [2024-11-12 20:21:15,461 INFO L226 Difference]: Without dead ends: 8123 [2024-11-12 20:21:15,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-12 20:21:15,470 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 880 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:15,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 4237 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 20:21:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8123 states. [2024-11-12 20:21:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8123 to 6014. [2024-11-12 20:21:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6014 states, 5800 states have (on average 1.4244827586206896) internal successors, (8262), 5823 states have internal predecessors, (8262), 157 states have call successors, (157), 50 states have call predecessors, (157), 44 states have return successors, (192), 140 states have call predecessors, (192), 157 states have call successors, (192) [2024-11-12 20:21:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6014 states to 6014 states and 8611 transitions. [2024-11-12 20:21:15,607 INFO L78 Accepts]: Start accepts. Automaton has 6014 states and 8611 transitions. Word has length 132 [2024-11-12 20:21:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 6014 states and 8611 transitions. [2024-11-12 20:21:15,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6014 states and 8611 transitions. [2024-11-12 20:21:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 20:21:15,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:15,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:15,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 20:21:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:15,814 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 263134314, now seen corresponding path program 1 times [2024-11-12 20:21:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:15,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85430090] [2024-11-12 20:21:15,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:21:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 20:21:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 20:21:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 20:21:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 20:21:16,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:16,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85430090] [2024-11-12 20:21:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85430090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180363402] [2024-11-12 20:21:16,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:16,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:16,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 20:21:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:16,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 20:21:16,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:21:16,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180363402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:16,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:16,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2024-11-12 20:21:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112641780] [2024-11-12 20:21:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:16,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 20:21:16,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:21:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:21:16,749 INFO L87 Difference]: Start difference. First operand 6014 states and 8611 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 20:21:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:16,955 INFO L93 Difference]: Finished difference Result 9134 states and 13038 transitions. [2024-11-12 20:21:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:21:16,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 133 [2024-11-12 20:21:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:16,964 INFO L225 Difference]: With dead ends: 9134 [2024-11-12 20:21:16,964 INFO L226 Difference]: Without dead ends: 3273 [2024-11-12 20:21:16,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:21:16,974 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 13 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5266 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:16,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5266 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:21:16,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-12 20:21:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3271. [2024-11-12 20:21:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 3133 states have (on average 1.4127034790935207) internal successors, (4426), 3149 states have internal predecessors, (4426), 86 states have call successors, (86), 42 states have call predecessors, (86), 39 states have return successors, (97), 79 states have call predecessors, (97), 86 states have call successors, (97) [2024-11-12 20:21:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4609 transitions. [2024-11-12 20:21:17,101 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4609 transitions. Word has length 133 [2024-11-12 20:21:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:17,101 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4609 transitions. [2024-11-12 20:21:17,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 20:21:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4609 transitions. [2024-11-12 20:21:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 20:21:17,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:17,102 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:17,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 20:21:17,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 20:21:17,303 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash 578798716, now seen corresponding path program 1 times [2024-11-12 20:21:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462258092] [2024-11-12 20:21:17,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:21:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 20:21:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 20:21:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 20:21:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 20:21:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462258092] [2024-11-12 20:21:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462258092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50763655] [2024-11-12 20:21:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:17,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:17,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:17,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 20:21:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:18,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 20:21:18,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 20:21:18,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-12 20:21:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50763655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:21:18,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:21:18,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 18 [2024-11-12 20:21:18,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684397035] [2024-11-12 20:21:18,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:21:18,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 20:21:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 20:21:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-12 20:21:18,564 INFO L87 Difference]: Start difference. First operand 3271 states and 4609 transitions. Second operand has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:19,552 INFO L93 Difference]: Finished difference Result 6452 states and 9113 transitions. [2024-11-12 20:21:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 20:21:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2024-11-12 20:21:19,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:19,559 INFO L225 Difference]: With dead ends: 6452 [2024-11-12 20:21:19,559 INFO L226 Difference]: Without dead ends: 3343 [2024-11-12 20:21:19,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 20:21:19,564 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 105 mSDsluCounter, 6162 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 6801 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:19,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 6801 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:21:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2024-11-12 20:21:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3311. [2024-11-12 20:21:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3311 states, 3172 states have (on average 1.4126733921815888) internal successors, (4481), 3185 states have internal predecessors, (4481), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4660 transitions. [2024-11-12 20:21:19,634 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4660 transitions. Word has length 135 [2024-11-12 20:21:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:19,634 INFO L471 AbstractCegarLoop]: Abstraction has 3311 states and 4660 transitions. [2024-11-12 20:21:19,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 16 states have internal predecessors, (155), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4660 transitions. [2024-11-12 20:21:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 20:21:19,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:19,635 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:19,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 20:21:19,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 20:21:19,839 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1627055286, now seen corresponding path program 2 times [2024-11-12 20:21:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756335778] [2024-11-12 20:21:19,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:21:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 20:21:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 20:21:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 20:21:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 20:21:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756335778] [2024-11-12 20:21:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756335778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503801021] [2024-11-12 20:21:20,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:21:20,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:20,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:20,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:20,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 20:21:20,637 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:21:20,637 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:21:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:21:20,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:20,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 20:21:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:21:20,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:20,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503801021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:20,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:20,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2024-11-12 20:21:20,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656471395] [2024-11-12 20:21:20,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:20,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:21:20,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:21:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:21:20,662 INFO L87 Difference]: Start difference. First operand 3311 states and 4660 transitions. Second operand has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:20,711 INFO L93 Difference]: Finished difference Result 3311 states and 4660 transitions. [2024-11-12 20:21:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:21:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 139 [2024-11-12 20:21:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:20,717 INFO L225 Difference]: With dead ends: 3311 [2024-11-12 20:21:20,717 INFO L226 Difference]: Without dead ends: 3310 [2024-11-12 20:21:20,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:21:20,718 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 1 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:20,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1340 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:21:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2024-11-12 20:21:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3310. [2024-11-12 20:21:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3172 states have (on average 1.41078184110971) internal successors, (4475), 3184 states have internal predecessors, (4475), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4654 transitions. [2024-11-12 20:21:20,782 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4654 transitions. Word has length 139 [2024-11-12 20:21:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:20,782 INFO L471 AbstractCegarLoop]: Abstraction has 3310 states and 4654 transitions. [2024-11-12 20:21:20,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4654 transitions. [2024-11-12 20:21:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 20:21:20,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:20,785 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:20,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 20:21:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 20:21:20,986 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1100893789, now seen corresponding path program 1 times [2024-11-12 20:21:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585285208] [2024-11-12 20:21:20,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:21:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 20:21:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 20:21:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 20:21:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 20:21:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585285208] [2024-11-12 20:21:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585285208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763103367] [2024-11-12 20:21:21,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:21,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:21,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 20:21:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:21,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:21:21,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 20:21:22,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-12 20:21:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763103367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:21:22,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:21:22,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 9] total 28 [2024-11-12 20:21:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621301740] [2024-11-12 20:21:22,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:21:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 20:21:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 20:21:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-11-12 20:21:22,220 INFO L87 Difference]: Start difference. First operand 3310 states and 4654 transitions. Second operand has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:23,825 INFO L93 Difference]: Finished difference Result 6329 states and 8878 transitions. [2024-11-12 20:21:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 20:21:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2024-11-12 20:21:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:23,831 INFO L225 Difference]: With dead ends: 6329 [2024-11-12 20:21:23,831 INFO L226 Difference]: Without dead ends: 3015 [2024-11-12 20:21:23,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=534, Invalid=2888, Unknown=0, NotChecked=0, Total=3422 [2024-11-12 20:21:23,836 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 149 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 7427 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:23,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 7427 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:21:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2024-11-12 20:21:23,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2993. [2024-11-12 20:21:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2855 states have (on average 1.386690017513135) internal successors, (3959), 2867 states have internal predecessors, (3959), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4138 transitions. [2024-11-12 20:21:23,903 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4138 transitions. Word has length 140 [2024-11-12 20:21:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:23,903 INFO L471 AbstractCegarLoop]: Abstraction has 2993 states and 4138 transitions. [2024-11-12 20:21:23,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 26 states have internal predecessors, (167), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4138 transitions. [2024-11-12 20:21:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 20:21:23,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:23,906 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:23,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-12 20:21:24,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 20:21:24,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:24,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1902020724, now seen corresponding path program 2 times [2024-11-12 20:21:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464196800] [2024-11-12 20:21:24,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:21:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:24,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 20:21:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 20:21:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 20:21:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 20:21:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464196800] [2024-11-12 20:21:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464196800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119930843] [2024-11-12 20:21:25,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:21:25,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:25,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:25,073 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:25,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 20:21:26,001 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:21:26,002 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:21:26,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 20:21:26,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:26,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:26,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:26,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 20:21:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-12 20:21:26,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:26,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119930843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:26,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2024-11-12 20:21:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021040663] [2024-11-12 20:21:26,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 20:21:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 20:21:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2024-11-12 20:21:26,688 INFO L87 Difference]: Start difference. First operand 2993 states and 4138 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:30,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 20:21:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:30,358 INFO L93 Difference]: Finished difference Result 7155 states and 9979 transitions. [2024-11-12 20:21:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 20:21:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 149 [2024-11-12 20:21:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:30,365 INFO L225 Difference]: With dead ends: 7155 [2024-11-12 20:21:30,365 INFO L226 Difference]: Without dead ends: 4208 [2024-11-12 20:21:30,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 20:21:30,369 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 721 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3677 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:30,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 3677 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 666 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2024-11-12 20:21:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4208 states. [2024-11-12 20:21:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4208 to 3081. [2024-11-12 20:21:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2943 states have (on average 1.3876996262317363) internal successors, (4084), 2955 states have internal predecessors, (4084), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4263 transitions. [2024-11-12 20:21:30,446 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4263 transitions. Word has length 149 [2024-11-12 20:21:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:30,446 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 4263 transitions. [2024-11-12 20:21:30,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 12 states have internal predecessors, (114), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4263 transitions. [2024-11-12 20:21:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 20:21:30,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:30,447 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:30,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 20:21:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:30,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:30,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1534678927, now seen corresponding path program 1 times [2024-11-12 20:21:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:30,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375917510] [2024-11-12 20:21:30,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:21:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 20:21:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 20:21:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 20:21:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-12 20:21:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375917510] [2024-11-12 20:21:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375917510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:31,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 20:21:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144362731] [2024-11-12 20:21:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 20:21:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:31,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:21:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:21:31,004 INFO L87 Difference]: Start difference. First operand 3081 states and 4263 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 20:21:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:31,617 INFO L93 Difference]: Finished difference Result 6142 states and 8514 transitions. [2024-11-12 20:21:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:21:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 150 [2024-11-12 20:21:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:31,625 INFO L225 Difference]: With dead ends: 6142 [2024-11-12 20:21:31,626 INFO L226 Difference]: Without dead ends: 3116 [2024-11-12 20:21:31,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:21:31,630 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 57 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:31,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3833 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:21:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2024-11-12 20:21:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3109. [2024-11-12 20:21:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 2971 states have (on average 1.3864018848872433) internal successors, (4119), 2983 states have internal predecessors, (4119), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 4298 transitions. [2024-11-12 20:21:31,735 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 4298 transitions. Word has length 150 [2024-11-12 20:21:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:31,735 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 4298 transitions. [2024-11-12 20:21:31,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 20:21:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 4298 transitions. [2024-11-12 20:21:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 20:21:31,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:31,737 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:31,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 20:21:31,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:31,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 242504778, now seen corresponding path program 1 times [2024-11-12 20:21:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:31,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98249253] [2024-11-12 20:21:31,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:21:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 20:21:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 20:21:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 20:21:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-12 20:21:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98249253] [2024-11-12 20:21:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98249253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:32,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:21:32,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 20:21:32,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343015807] [2024-11-12 20:21:32,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:32,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:21:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:21:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:21:32,062 INFO L87 Difference]: Start difference. First operand 3109 states and 4298 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 20:21:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:32,553 INFO L93 Difference]: Finished difference Result 6187 states and 8569 transitions. [2024-11-12 20:21:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 20:21:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 150 [2024-11-12 20:21:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:32,560 INFO L225 Difference]: With dead ends: 6187 [2024-11-12 20:21:32,560 INFO L226 Difference]: Without dead ends: 3130 [2024-11-12 20:21:32,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:21:32,565 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 52 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 2952 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:32,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 2952 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:21:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-11-12 20:21:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3130. [2024-11-12 20:21:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 2992 states have (on average 1.3836898395721926) internal successors, (4140), 3004 states have internal predecessors, (4140), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4319 transitions. [2024-11-12 20:21:32,637 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4319 transitions. Word has length 150 [2024-11-12 20:21:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 3130 states and 4319 transitions. [2024-11-12 20:21:32,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 20:21:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4319 transitions. [2024-11-12 20:21:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 20:21:32,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:32,638 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:32,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 20:21:32,638 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 985063040, now seen corresponding path program 1 times [2024-11-12 20:21:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331284010] [2024-11-12 20:21:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:21:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 20:21:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 20:21:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 20:21:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 20:21:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331284010] [2024-11-12 20:21:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331284010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082464038] [2024-11-12 20:21:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:33,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 20:21:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:33,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 20:21:33,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-12 20:21:34,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:21:34,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082464038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:21:34,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:21:34,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-12 20:21:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698674913] [2024-11-12 20:21:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:21:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:21:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:21:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:21:34,003 INFO L87 Difference]: Start difference. First operand 3130 states and 4319 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:34,282 INFO L93 Difference]: Finished difference Result 6233 states and 8616 transitions. [2024-11-12 20:21:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:21:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 151 [2024-11-12 20:21:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:34,288 INFO L225 Difference]: With dead ends: 6233 [2024-11-12 20:21:34,288 INFO L226 Difference]: Without dead ends: 3151 [2024-11-12 20:21:34,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2024-11-12 20:21:34,291 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 43 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:34,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3170 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:21:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2024-11-12 20:21:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3056. [2024-11-12 20:21:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2918 states have (on average 1.3783413296778615) internal successors, (4022), 2930 states have internal predecessors, (4022), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4201 transitions. [2024-11-12 20:21:34,362 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 4201 transitions. Word has length 151 [2024-11-12 20:21:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:34,362 INFO L471 AbstractCegarLoop]: Abstraction has 3056 states and 4201 transitions. [2024-11-12 20:21:34,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 20:21:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 4201 transitions. [2024-11-12 20:21:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 20:21:34,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:34,363 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:34,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-12 20:21:34,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-12 20:21:34,564 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:34,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2133926409, now seen corresponding path program 1 times [2024-11-12 20:21:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951696251] [2024-11-12 20:21:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:21:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 20:21:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 20:21:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 20:21:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 20:21:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951696251] [2024-11-12 20:21:35,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951696251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:35,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849809335] [2024-11-12 20:21:35,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:35,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:35,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:35,604 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:35,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 20:21:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:36,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 20:21:36,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 86 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:21:36,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:21:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 126 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-12 20:21:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849809335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:21:36,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:21:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 15] total 45 [2024-11-12 20:21:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330215667] [2024-11-12 20:21:36,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:21:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-12 20:21:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:21:36,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-12 20:21:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 20:21:36,978 INFO L87 Difference]: Start difference. First operand 3056 states and 4201 transitions. Second operand has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:41,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:21:41,044 INFO L93 Difference]: Finished difference Result 6148 states and 8525 transitions. [2024-11-12 20:21:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-12 20:21:41,045 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 151 [2024-11-12 20:21:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:21:41,062 INFO L225 Difference]: With dead ends: 6148 [2024-11-12 20:21:41,063 INFO L226 Difference]: Without dead ends: 3180 [2024-11-12 20:21:41,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2024-11-12 20:21:41,075 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 126 mSDsluCounter, 16933 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 17494 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:21:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 17494 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 20:21:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-11-12 20:21:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3146. [2024-11-12 20:21:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 3008 states have (on average 1.3690159574468086) internal successors, (4118), 3020 states have internal predecessors, (4118), 86 states have call successors, (86), 46 states have call predecessors, (86), 40 states have return successors, (93), 79 states have call predecessors, (93), 86 states have call successors, (93) [2024-11-12 20:21:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4297 transitions. [2024-11-12 20:21:41,179 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4297 transitions. Word has length 151 [2024-11-12 20:21:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:21:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 4297 transitions. [2024-11-12 20:21:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.111111111111111) internal successors, (185), 43 states have internal predecessors, (185), 3 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-12 20:21:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4297 transitions. [2024-11-12 20:21:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 20:21:41,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:21:41,181 INFO L218 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:21:41,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-12 20:21:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:41,386 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [alt_mallocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_mallocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, alt_freeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-12 20:21:41,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:21:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1438529495, now seen corresponding path program 2 times [2024-11-12 20:21:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:21:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591306683] [2024-11-12 20:21:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:21:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:21:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:21:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 20:21:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 20:21:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 20:21:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 20:21:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:21:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 7 proven. 534 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-12 20:21:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:21:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591306683] [2024-11-12 20:21:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591306683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:21:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459646563] [2024-11-12 20:21:43,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:21:43,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:21:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:21:43,201 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:21:43,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-12 20:21:44,077 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:21:44,077 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:21:44,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 293 conjuncts are in the unsatisfiable core [2024-11-12 20:21:44,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:21:44,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:44,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 20:21:44,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:44,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 20:21:44,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:21:44,649 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 20:21:44,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 20:21:44,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:21:44,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 20:21:44,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-12 20:21:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:21:45,472 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 20:21:45,473 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-12 20:21:45,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:21:45,572 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:45,595 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:45,611 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-12 20:21:45,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1015 [2024-11-12 20:21:45,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-12 20:21:45,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-11-12 20:21:45,665 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:45,685 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-12 20:21:45,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1015 [2024-11-12 20:21:45,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-12 20:21:45,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-11-12 20:21:45,729 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:45,767 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1394 treesize of output 1344 [2024-11-12 20:21:45,786 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1259 treesize of output 1233 [2024-11-12 20:21:45,803 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2024-11-12 20:21:45,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1262 treesize of output 995 [2024-11-12 20:21:45,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:21:45,847 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:45,863 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:45,878 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:45,900 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:45,910 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:45,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:45,926 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:45,947 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1243 treesize of output 1221 [2024-11-12 20:21:45,962 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:45,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1108 treesize of output 1110 [2024-11-12 20:21:45,976 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:45,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 1 [2024-11-12 20:21:46,020 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:46,034 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:46,049 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:46,073 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:46,090 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:46,101 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:46,141 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:46,156 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:46,179 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:46,200 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1394 treesize of output 1344 [2024-11-12 20:21:46,213 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1262 treesize of output 1 [2024-11-12 20:21:46,228 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1259 treesize of output 1233 [2024-11-12 20:21:46,275 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1108 treesize of output 1110 [2024-11-12 20:21:46,286 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 1 [2024-11-12 20:21:46,301 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1243 treesize of output 1221 [2024-11-12 20:21:46,315 INFO L349 Elim1Store]: treesize reduction 53, result has 1.9 percent of original size [2024-11-12 20:21:46,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 1288 treesize of output 1 [2024-11-12 20:21:46,329 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1285 treesize of output 1253 [2024-11-12 20:21:46,346 INFO L349 Elim1Store]: treesize reduction 293, result has 0.3 percent of original size [2024-11-12 20:21:46,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 1420 treesize of output 1364 [2024-11-12 20:21:46,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 20:21:46,800 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-12 20:21:46,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-12 20:21:46,905 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-12 20:21:46,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-11-12 20:21:46,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 20:21:46,916 INFO L349 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2024-11-12 20:21:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 23 [2024-11-12 20:21:46,939 INFO L349 Elim1Store]: treesize reduction 137, result has 9.9 percent of original size [2024-11-12 20:21:46,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 110 [2024-11-12 20:21:46,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 20:21:46,956 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-11-12 20:21:46,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 37 [2024-11-12 20:22:03,015 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 388 DAG size of output: 79 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-12 20:22:03,016 INFO L349 Elim1Store]: treesize reduction 3832, result has 4.4 percent of original size [2024-11-12 20:22:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 17 new quantified variables, introduced 20 case distinctions, treesize of input 400 treesize of output 421 [2024-11-12 20:22:03,646 INFO L349 Elim1Store]: treesize reduction 2867, result has 10.2 percent of original size [2024-11-12 20:22:03,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 14 new quantified variables, introduced 13 case distinctions, treesize of input 740 treesize of output 800 [2024-11-12 20:22:05,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 20:22:05,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 20:22:06,349 INFO L349 Elim1Store]: treesize reduction 1498, result has 4.9 percent of original size [2024-11-12 20:22:06,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 3 disjoint index pairs (out of 120 index pairs), introduced 29 new quantified variables, introduced 130 case distinctions, treesize of input 819 treesize of output 546 [2024-11-12 20:22:06,599 INFO L349 Elim1Store]: treesize reduction 740, result has 2.5 percent of original size [2024-11-12 20:22:06,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 4 disjoint index pairs (out of 105 index pairs), introduced 26 new quantified variables, introduced 71 case distinctions, treesize of input 751 treesize of output 557 [2024-11-12 20:22:09,146 INFO L349 Elim1Store]: treesize reduction 1228, result has 8.8 percent of original size [2024-11-12 20:22:09,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 29 new quantified variables, introduced 119 case distinctions, treesize of input 916 treesize of output 582 [2024-11-12 20:22:09,222 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-11-12 20:22:09,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 912 treesize of output 619 [2024-11-12 20:22:09,267 INFO L349 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2024-11-12 20:22:09,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 738 treesize of output 591 [2024-11-12 20:22:09,316 INFO L349 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2024-11-12 20:22:09,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 554 treesize of output 376 [2024-11-12 20:22:09,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:22:09,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 494 treesize of output 352 [2024-11-12 20:22:09,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 31 [2024-11-12 20:22:09,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 122 [2024-11-12 20:22:09,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 31 [2024-11-12 20:22:09,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:22:09,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 177 treesize of output 221 [2024-11-12 20:22:10,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 184 [2024-11-12 20:22:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 12 proven. 447 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-12 20:22:11,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:22:11,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_~_ha_bkt~0#1| 4294967296)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse0 (select |c_#memory_$Pointer$#3.offset| .cse2)) (.cse4 (select |c_#memory_$Pointer$#3.base| .cse2)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse1 (+ .cse5 .cse6 (- 51539607548))) (.cse3 (+ (- 51539607552) .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_6990 .cse1)) v_ArrVal_6990)) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse2) .cse3) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 (store .cse4 .cse1 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse2) .cse3) 0)))) (< .cse7 2147483648)) (or (let ((.cse8 (+ .cse5 .cse6 4)) (.cse9 (+ .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store .cse0 .cse8 (select v_ArrVal_6990 .cse8)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse2 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse2) .cse9) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse2 (store .cse4 .cse8 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse2) .cse9) 0)))) (< 2147483647 .cse7))))))) is different from false [2024-11-12 20:22:11,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12)) (.cse11 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse12))) (let ((.cse7 (mod |c_ULTIMATE.start_main_#t~bitwise115#1| 4294967296)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse10) .cse11))) (let ((.cse2 (select |c_#memory_$Pointer$#3.offset| .cse0)) (.cse4 (select |c_#memory_$Pointer$#3.base| .cse0)) (.cse5 (* .cse7 12)) (.cse6 (select (select |c_#memory_$Pointer$#3.offset| .cse10) .cse11))) (and (or (let ((.cse3 (+ .cse5 .cse6 (- 51539607548))) (.cse1 (+ .cse5 (- 51539607552) .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse1) 0)) (not (= (store .cse2 .cse3 (select v_ArrVal_6990 .cse3)) v_ArrVal_6990)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store .cse4 .cse3 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse1) 0)))) (< .cse7 2147483648)) (or (< 2147483647 .cse7) (let ((.cse8 (+ .cse5 .cse6 4)) (.cse9 (+ .cse5 .cse6))) (and (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store .cse2 .cse8 (select v_ArrVal_6990 .cse8)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse9) 0)))) (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store .cse4 .cse8 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse9) 0)))))))))) is different from false [2024-11-12 20:22:11,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse5))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.offset| .cse3) .cse4))) (let ((.cse1 (+ .cse2 4)) (.cse0 (select (select |c_#memory_$Pointer$#3.base| .cse3) .cse4))) (and (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int)) (= (select (select (store (store |c_#memory_$Pointer$#3.base| .cse0 (store (select |c_#memory_$Pointer$#3.base| .cse0) .cse1 v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse0) .cse2) 0)) (forall ((v_ArrVal_6990 (Array Int Int))) (or (not (= v_ArrVal_6990 (store (select |c_#memory_$Pointer$#3.offset| .cse0) .cse1 (select v_ArrVal_6990 .cse1)))) (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse0) .cse2) 0))))))))) is different from false [2024-11-12 20:22:11,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~users~0#1.offset| 8))) (let ((.cse7 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse8 (select |c_#memory_$Pointer$#3.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$#3.offset| .cse7)) (.cse9 (+ (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~users~0#1.base|) .cse6) 12))) (and (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int) (v_ArrVal_6985 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_6986)) (.cse0 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_6985)))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse2 (select (select .cse5 .cse3) .cse4))) (select (let ((.cse1 (select (select .cse0 .cse3) .cse4))) (select (store (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 4) v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse1)) .cse2)))) 0)) (not (= (store .cse10 .cse9 (select v_ArrVal_6986 .cse9)) v_ArrVal_6986)))) (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6990 (Array Int Int)) (v_ArrVal_6985 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#3.offset| .cse7 v_ArrVal_6986)) (.cse17 (store |c_#memory_$Pointer$#3.base| .cse7 (store .cse8 .cse9 v_ArrVal_6985)))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6)) (.cse16 (select (select .cse11 |c_ULTIMATE.start_main_~users~0#1.base|) .cse6))) (let ((.cse12 (select (select .cse17 .cse15) .cse16)) (.cse13 (select (select .cse11 .cse15) .cse16))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store .cse11 .cse12 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse12) .cse13) 0)) (not (= (let ((.cse14 (+ .cse13 4))) (store (select .cse11 .cse12) .cse14 (select v_ArrVal_6990 .cse14))) v_ArrVal_6990))))))) (not (= (store .cse10 .cse9 (select v_ArrVal_6986 .cse9)) v_ArrVal_6986)))))))) is different from false [2024-11-12 20:22:11,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse10 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (select |c_#memory_$Pointer$#3.base| .cse10)) (.cse0 (select |c_#memory_$Pointer$#3.offset| .cse10)) (.cse1 (+ 12 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)))) (and (forall ((v_ArrVal_6986 (Array Int Int))) (or (not (= v_ArrVal_6986 (store .cse0 .cse1 (select v_ArrVal_6986 .cse1)))) (forall ((v_ArrVal_6990 (Array Int Int)) (v_ArrVal_6985 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_6986)) (.cse8 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_6985)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse3 (select (select .cse8 .cse6) .cse7)) (.cse4 (select (select .cse2 .cse6) .cse7))) (or (forall ((v_ArrVal_6992 (Array Int Int))) (= (select (select (store (store .cse2 .cse3 v_ArrVal_6990) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6992) .cse3) .cse4) 0)) (not (= (let ((.cse5 (+ .cse4 4))) (store (select .cse2 .cse3) .cse5 (select v_ArrVal_6990 .cse5))) v_ArrVal_6990))))))))) (forall ((v_ArrVal_6986 (Array Int Int))) (or (forall ((v_ArrVal_6991 (Array Int Int)) (v_ArrVal_6988 Int) (v_ArrVal_6985 Int)) (= (let ((.cse17 (store |c_#memory_$Pointer$#3.offset| .cse10 v_ArrVal_6986)) (.cse12 (store |c_#memory_$Pointer$#3.base| .cse10 (store .cse11 .cse1 v_ArrVal_6985)))) (let ((.cse15 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9)) (.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse14 (select (select .cse17 .cse15) .cse16))) (select (let ((.cse13 (select (select .cse12 .cse15) .cse16))) (select (store (store .cse12 .cse13 (store (select .cse12 .cse13) (+ .cse14 4) v_ArrVal_6988)) |c_ULTIMATE.start_main_~user~0#1.base| v_ArrVal_6991) .cse13)) .cse14)))) 0)) (not (= v_ArrVal_6986 (store .cse0 .cse1 (select v_ArrVal_6986 .cse1)))))))))) is different from false