./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:35:25,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:35:25,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 23:35:25,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:35:25,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:35:25,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:35:25,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:35:25,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:35:25,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:35:25,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:35:25,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:35:25,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:35:25,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:35:25,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:35:25,259 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:35:25,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:35:25,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:35:25,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 23:35:25,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:35:25,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 23:35:25,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:35:25,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:35:25,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 23:35:25,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:35:25,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:35:25,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:35:25,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:35:25,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:35:25,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:35:25,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:35:25,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:35:25,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:35:25,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:35:25,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:35:25,269 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-clean/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-clean/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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-10-11 23:35:25,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:35:25,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:35:25,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:35:25,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:35:25,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:35:25,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-10-11 23:35:26,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:35:27,043 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:35:27,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-1.i [2024-10-11 23:35:27,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b0896bf5/619582d2c87846cea0b520cf9a230fdf/FLAGa1524f831 [2024-10-11 23:35:27,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b0896bf5/619582d2c87846cea0b520cf9a230fdf [2024-10-11 23:35:27,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:35:27,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:35:27,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:35:27,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:35:27,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:35:27,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:27" (1/1) ... [2024-10-11 23:35:27,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d08f0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:27, skipping insertion in model container [2024-10-11 23:35:27,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:27" (1/1) ... [2024-10-11 23:35:27,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:35:28,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:35:28,028 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:35:28,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:35:28,156 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:35:28,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28 WrapperNode [2024-10-11 23:35:28,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:35:28,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:35:28,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:35:28,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:35:28,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,229 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1285 [2024-10-11 23:35:28,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:35:28,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:35:28,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:35:28,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:35:28,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,302 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-10-11 23:35:28,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:35:28,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:35:28,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:35:28,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:35:28,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (1/1) ... [2024-10-11 23:35:28,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:35:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:35:28,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:35:28,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:35:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 23:35:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 23:35:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 23:35:28,444 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 23:35:28,444 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 23:35:28,444 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 23:35:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 23:35:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 23:35:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 23:35:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 23:35:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 23:35:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 23:35:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 23:35:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 23:35:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:35:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:35:28,611 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:35:28,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:35:29,605 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2024-10-11 23:35:29,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:35:29,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:35:29,645 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 23:35:29,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:29 BoogieIcfgContainer [2024-10-11 23:35:29,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:35:29,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:35:29,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:35:29,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:35:29,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:35:27" (1/3) ... [2024-10-11 23:35:29,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d64fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:29, skipping insertion in model container [2024-10-11 23:35:29,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:28" (2/3) ... [2024-10-11 23:35:29,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d64fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:29, skipping insertion in model container [2024-10-11 23:35:29,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:29" (3/3) ... [2024-10-11 23:35:29,651 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-1.i [2024-10-11 23:35:29,662 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:35:29,663 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 23:35:29,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:35:29,724 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;@bc2d537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:35:29,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 23:35:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 363 states have (on average 1.6308539944903582) internal successors, (592), 369 states have internal predecessors, (592), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:29,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 23:35:29,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:29,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:29,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1291191429, now seen corresponding path program 1 times [2024-10-11 23:35:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935242486] [2024-10-11 23:35:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:29,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:29,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935242486] [2024-10-11 23:35:29,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935242486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:29,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:29,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:35:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146722316] [2024-10-11 23:35:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:29,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 23:35:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:30,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 23:35:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 23:35:30,004 INFO L87 Difference]: Start difference. First operand has 374 states, 363 states have (on average 1.6308539944903582) internal successors, (592), 369 states have internal predecessors, (592), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:30,072 INFO L93 Difference]: Finished difference Result 745 states and 1192 transitions. [2024-10-11 23:35:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 23:35:30,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 23:35:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:30,084 INFO L225 Difference]: With dead ends: 745 [2024-10-11 23:35:30,084 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 23:35:30,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 23:35:30,091 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:30,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:35:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 23:35:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-10-11 23:35:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 359 states have (on average 1.4651810584958218) internal successors, (526), 364 states have internal predecessors, (526), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 532 transitions. [2024-10-11 23:35:30,135 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 532 transitions. Word has length 7 [2024-10-11 23:35:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:30,135 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 532 transitions. [2024-10-11 23:35:30,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 532 transitions. [2024-10-11 23:35:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 23:35:30,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:30,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:35:30,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1291189507, now seen corresponding path program 1 times [2024-10-11 23:35:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705940521] [2024-10-11 23:35:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 23:35:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869759376] [2024-10-11 23:35:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:30,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:35:30,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:35:30,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:35:30,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:35:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:30,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 23:35:30,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:35:30,362 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-10-11 23:35:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:30,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:35:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:30,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705940521] [2024-10-11 23:35:30,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 23:35:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869759376] [2024-10-11 23:35:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869759376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:30,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:30,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:35:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943976697] [2024-10-11 23:35:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:30,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:35:30,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:30,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:35:30,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:35:30,398 INFO L87 Difference]: Start difference. First operand 369 states and 532 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:30,505 INFO L93 Difference]: Finished difference Result 733 states and 1059 transitions. [2024-10-11 23:35:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:35:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 23:35:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:30,508 INFO L225 Difference]: With dead ends: 733 [2024-10-11 23:35:30,508 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 23:35:30,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:35:30,509 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 514 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:30,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1517 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:35:30,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 23:35:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 375. [2024-10-11 23:35:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 365 states have (on average 1.4602739726027398) internal successors, (533), 370 states have internal predecessors, (533), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 539 transitions. [2024-10-11 23:35:30,526 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 539 transitions. Word has length 7 [2024-10-11 23:35:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 539 transitions. [2024-10-11 23:35:30,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 539 transitions. [2024-10-11 23:35:30,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 23:35:30,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:30,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:30,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:35:30,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:35:30,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:30,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1749443423, now seen corresponding path program 1 times [2024-10-11 23:35:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:30,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917535464] [2024-10-11 23:35:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:30,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917535464] [2024-10-11 23:35:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917535464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:30,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:35:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304836782] [2024-10-11 23:35:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:35:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:35:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:35:30,977 INFO L87 Difference]: Start difference. First operand 375 states and 539 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 23:35:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:31,044 INFO L93 Difference]: Finished difference Result 493 states and 708 transitions. [2024-10-11 23:35:31,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:35:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-10-11 23:35:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:31,046 INFO L225 Difference]: With dead ends: 493 [2024-10-11 23:35:31,046 INFO L226 Difference]: Without dead ends: 333 [2024-10-11 23:35:31,047 INFO L431 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-10-11 23:35:31,048 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 30 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:31,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1264 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:35:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-11 23:35:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-10-11 23:35:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.411764705882353) internal successors, (456), 328 states have internal predecessors, (456), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 462 transitions. [2024-10-11 23:35:31,065 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 462 transitions. Word has length 66 [2024-10-11 23:35:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:31,066 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 462 transitions. [2024-10-11 23:35:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 23:35:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 462 transitions. [2024-10-11 23:35:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 23:35:31,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:31,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:31,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:35:31,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash 321756053, now seen corresponding path program 1 times [2024-10-11 23:35:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610798177] [2024-10-11 23:35:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:31,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610798177] [2024-10-11 23:35:31,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610798177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:31,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:31,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:35:31,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264355943] [2024-10-11 23:35:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:31,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:35:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:31,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:35:31,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:35:31,361 INFO L87 Difference]: Start difference. First operand 333 states and 462 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 23:35:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:31,414 INFO L93 Difference]: Finished difference Result 647 states and 903 transitions. [2024-10-11 23:35:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:35:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-10-11 23:35:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:31,417 INFO L225 Difference]: With dead ends: 647 [2024-10-11 23:35:31,417 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 23:35:31,418 INFO L431 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-10-11 23:35:31,418 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 373 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:31,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1294 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:35:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 23:35:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 449. [2024-10-11 23:35:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 439 states have (on average 1.3940774487471526) internal successors, (612), 444 states have internal predecessors, (612), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 618 transitions. [2024-10-11 23:35:31,429 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 618 transitions. Word has length 66 [2024-10-11 23:35:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 618 transitions. [2024-10-11 23:35:31,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 23:35:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 618 transitions. [2024-10-11 23:35:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:35:31,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:31,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:31,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:35:31,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:31,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1653968423, now seen corresponding path program 1 times [2024-10-11 23:35:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:31,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51847792] [2024-10-11 23:35:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51847792] [2024-10-11 23:35:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51847792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:35:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524875759] [2024-10-11 23:35:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:31,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:35:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:35:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:35:31,583 INFO L87 Difference]: Start difference. First operand 449 states and 618 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:31,639 INFO L93 Difference]: Finished difference Result 848 states and 1161 transitions. [2024-10-11 23:35:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:35:31,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:35:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:31,641 INFO L225 Difference]: With dead ends: 848 [2024-10-11 23:35:31,641 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 23:35:31,641 INFO L431 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-10-11 23:35:31,642 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 36 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:31,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1011 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:35:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 23:35:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2024-10-11 23:35:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 397 states have (on average 1.3476070528967254) internal successors, (535), 402 states have internal predecessors, (535), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 541 transitions. [2024-10-11 23:35:31,649 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 541 transitions. Word has length 81 [2024-10-11 23:35:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:31,649 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 541 transitions. [2024-10-11 23:35:31,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 541 transitions. [2024-10-11 23:35:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:35:31,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:31,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:35:31,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1429434043, now seen corresponding path program 1 times [2024-10-11 23:35:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209559202] [2024-10-11 23:35:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209559202] [2024-10-11 23:35:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209559202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:31,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:31,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:35:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738874960] [2024-10-11 23:35:31,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:35:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:35:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:35:31,741 INFO L87 Difference]: Start difference. First operand 407 states and 541 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:31,782 INFO L93 Difference]: Finished difference Result 800 states and 1067 transitions. [2024-10-11 23:35:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:35:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:35:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:31,784 INFO L225 Difference]: With dead ends: 800 [2024-10-11 23:35:31,784 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 23:35:31,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:35:31,786 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 9 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1012 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:35:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 23:35:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-10-11 23:35:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.3427109974424551) internal successors, (525), 396 states have internal predecessors, (525), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 531 transitions. [2024-10-11 23:35:31,793 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 531 transitions. Word has length 81 [2024-10-11 23:35:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:31,794 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 531 transitions. [2024-10-11 23:35:31,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,794 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 531 transitions. [2024-10-11 23:35:31,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:35:31,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:31,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:31,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:35:31,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:31,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1006907571, now seen corresponding path program 1 times [2024-10-11 23:35:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:31,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286504276] [2024-10-11 23:35:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:35:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286504276] [2024-10-11 23:35:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286504276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:35:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312280375] [2024-10-11 23:35:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:31,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:35:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:35:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:35:31,921 INFO L87 Difference]: Start difference. First operand 401 states and 531 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:31,971 INFO L93 Difference]: Finished difference Result 1066 states and 1417 transitions. [2024-10-11 23:35:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:35:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:35:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:31,974 INFO L225 Difference]: With dead ends: 1066 [2024-10-11 23:35:31,974 INFO L226 Difference]: Without dead ends: 673 [2024-10-11 23:35:31,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-11 23:35:31,975 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 178 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:31,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 702 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:35:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-11 23:35:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 671. [2024-10-11 23:35:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 661 states have (on average 1.340393343419062) internal successors, (886), 666 states have internal predecessors, (886), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:35:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 892 transitions. [2024-10-11 23:35:31,989 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 892 transitions. Word has length 81 [2024-10-11 23:35:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:31,989 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 892 transitions. [2024-10-11 23:35:31,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:35:31,990 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 892 transitions. [2024-10-11 23:35:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 23:35:31,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:31,991 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:35:31,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:31,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:31,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1656953528, now seen corresponding path program 1 times [2024-10-11 23:35:31,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:31,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541036806] [2024-10-11 23:35:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:31,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 23:35:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:35:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:35:32,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:32,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541036806] [2024-10-11 23:35:32,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541036806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:35:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:35:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637609343] [2024-10-11 23:35:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:35:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:35:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:35:32,282 INFO L87 Difference]: Start difference. First operand 671 states and 892 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:35:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:32,463 INFO L93 Difference]: Finished difference Result 739 states and 986 transitions. [2024-10-11 23:35:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:35:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-10-11 23:35:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:32,467 INFO L225 Difference]: With dead ends: 739 [2024-10-11 23:35:32,467 INFO L226 Difference]: Without dead ends: 737 [2024-10-11 23:35:32,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:35:32,468 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 260 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:32,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1322 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 23:35:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-11 23:35:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2024-10-11 23:35:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 722 states have (on average 1.335180055401662) internal successors, (964), 727 states have internal predecessors, (964), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:35:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 976 transitions. [2024-10-11 23:35:32,480 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 976 transitions. Word has length 94 [2024-10-11 23:35:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:32,480 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 976 transitions. [2024-10-11 23:35:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:35:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 976 transitions. [2024-10-11 23:35:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 23:35:32,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:32,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:32,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:35:32,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -63747417, now seen corresponding path program 1 times [2024-10-11 23:35:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859520055] [2024-10-11 23:35:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 23:35:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:35:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:35:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859520055] [2024-10-11 23:35:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859520055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:35:32,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809886308] [2024-10-11 23:35:32,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:32,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:35:32,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:35:32,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:35:32,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:35:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:33,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 23:35:33,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:35:33,152 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-10-11 23:35:33,170 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-10-11 23:35:33,183 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-10-11 23:35:33,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 23:35:33,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-10-11 23:35:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:35:33,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:35:33,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809886308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:35:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:35:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 23:35:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795981776] [2024-10-11 23:35:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:35:33,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 23:35:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:35:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 23:35:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 23:35:33,711 INFO L87 Difference]: Start difference. First operand 735 states and 976 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:35:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:35:35,583 INFO L93 Difference]: Finished difference Result 1342 states and 1789 transitions. [2024-10-11 23:35:35,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 23:35:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-10-11 23:35:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:35:35,586 INFO L225 Difference]: With dead ends: 1342 [2024-10-11 23:35:35,586 INFO L226 Difference]: Without dead ends: 735 [2024-10-11 23:35:35,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-11 23:35:35,587 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 440 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 23:35:35,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 2673 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 23:35:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-11 23:35:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-10-11 23:35:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 722 states have (on average 1.3337950138504155) internal successors, (963), 727 states have internal predecessors, (963), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:35:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 975 transitions. [2024-10-11 23:35:35,599 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 975 transitions. Word has length 100 [2024-10-11 23:35:35,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:35:35,599 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 975 transitions. [2024-10-11 23:35:35,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:35:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 975 transitions. [2024-10-11 23:35:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 23:35:35,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:35:35,600 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:35:35,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 23:35:35,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:35:35,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:35:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:35:35,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1742091636, now seen corresponding path program 1 times [2024-10-11 23:35:35,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:35:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692660441] [2024-10-11 23:35:35,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:35:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:36,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:35:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 23:35:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:35:36,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:35:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692660441] [2024-10-11 23:35:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692660441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:35:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412381494] [2024-10-11 23:35:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:35:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:35:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:35:36,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:35:36,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:35:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:35:36,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 23:35:36,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:36:24,452 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 23:36:59,987 WARN L286 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 30 DAG size of output: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)