./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:43:52,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:43:52,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 13:43:52,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:43:52,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:43:52,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:43:52,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:43:52,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:43:52,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:43:52,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:43:52,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:43:52,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:43:52,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:43:52,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:43:52,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:43:52,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:43:52,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:43:52,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 13:43:52,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:43:52,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 13:43:52,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:43:52,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:43:52,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:43:52,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:43:52,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:43:52,397 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:43:52,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:43:52,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 13:43:52,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:43:52,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:43:52,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:43:52,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:43:52,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:43:52,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:43:52,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:43:52,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:43:52,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:43:52,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:43:52,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:43:52,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:43:52,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:43:52,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:43:52,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:43:52,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:43:52,403 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2024-11-19 13:43:52,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:43:52,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:43:52,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:43:52,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:43:52,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:43:52,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-11-19 13:43:54,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:43:54,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:43:54,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-11-19 13:43:54,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d34933e1d/a451021b394444f99c91bc1d5274267f/FLAG14fd5025d [2024-11-19 13:43:54,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d34933e1d/a451021b394444f99c91bc1d5274267f [2024-11-19 13:43:54,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:43:54,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:43:54,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:43:54,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:43:54,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:43:54,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:43:54" (1/1) ... [2024-11-19 13:43:54,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468c9a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:54, skipping insertion in model container [2024-11-19 13:43:54,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:43:54" (1/1) ... [2024-11-19 13:43:54,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:43:54,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:43:54,997 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:43:55,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:43:55,177 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:43:55,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55 WrapperNode [2024-11-19 13:43:55,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:43:55,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:43:55,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:43:55,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:43:55,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,276 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1310 [2024-11-19 13:43:55,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:43:55,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:43:55,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:43:55,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:43:55,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,364 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 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, 4, 42]. [2024-11-19 13:43:55,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:43:55,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:43:55,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:43:55,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:43:55,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (1/1) ... [2024-11-19 13:43:55,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:43:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:43:55,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 13:43:55,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 13:43:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 13:43:55,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 13:43:55,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 13:43:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 13:43:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 13:43:55,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 13:43:55,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 13:43:55,563 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 13:43:55,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 13:43:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:43:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:43:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 13:43:55,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:43:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 13:43:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 13:43:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 13:43:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 13:43:55,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 13:43:55,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 13:43:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 13:43:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 13:43:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:43:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:43:55,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:43:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:43:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 13:43:55,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 13:43:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 13:43:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 13:43:55,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:43:55,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:43:55,778 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:43:55,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:43:57,020 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2024-11-19 13:43:57,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:43:57,049 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:43:57,049 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-19 13:43:57,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:43:57 BoogieIcfgContainer [2024-11-19 13:43:57,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:43:57,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:43:57,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:43:57,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:43:57,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:43:54" (1/3) ... [2024-11-19 13:43:57,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:43:57, skipping insertion in model container [2024-11-19 13:43:57,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:43:55" (2/3) ... [2024-11-19 13:43:57,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:43:57, skipping insertion in model container [2024-11-19 13:43:57,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:43:57" (3/3) ... [2024-11-19 13:43:57,057 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2024-11-19 13:43:57,073 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:43:57,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 13:43:57,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:43:57,154 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;@a1e9dfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:43:57,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 13:43:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 398 states, 376 states have (on average 1.627659574468085) internal successors, (612), 391 states have internal predecessors, (612), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 13:43:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:43:57,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:57,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:57,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:57,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash 170881670, now seen corresponding path program 1 times [2024-11-19 13:43:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916250770] [2024-11-19 13:43:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:43:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916250770] [2024-11-19 13:43:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916250770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:57,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:43:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752129112] [2024-11-19 13:43:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 13:43:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 13:43:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:43:57,433 INFO L87 Difference]: Start difference. First operand has 398 states, 376 states have (on average 1.627659574468085) internal successors, (612), 391 states have internal predecessors, (612), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:57,495 INFO L93 Difference]: Finished difference Result 792 states and 1266 transitions. [2024-11-19 13:43:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 13:43:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 13:43:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:57,509 INFO L225 Difference]: With dead ends: 792 [2024-11-19 13:43:57,509 INFO L226 Difference]: Without dead ends: 389 [2024-11-19 13:43:57,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:43:57,517 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:57,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:43:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-19 13:43:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-19 13:43:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 371 states have (on average 1.4690026954177897) internal successors, (545), 383 states have internal predecessors, (545), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 13:43:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 561 transitions. [2024-11-19 13:43:57,592 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 561 transitions. Word has length 7 [2024-11-19 13:43:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:57,593 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 561 transitions. [2024-11-19 13:43:57,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 561 transitions. [2024-11-19 13:43:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 13:43:57,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:57,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:57,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:43:57,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:57,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 170883592, now seen corresponding path program 1 times [2024-11-19 13:43:57,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128020863] [2024-11-19 13:43:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 13:43:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213701157] [2024-11-19 13:43:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:57,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:43:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:43:57,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:43:57,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 13:43:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:57,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 13:43:57,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:43:57,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 13:43:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:43:57,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:43:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128020863] [2024-11-19 13:43:57,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 13:43:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213701157] [2024-11-19 13:43:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213701157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:57,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:43:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046298281] [2024-11-19 13:43:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:57,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:43:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:43:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:43:57,878 INFO L87 Difference]: Start difference. First operand 389 states and 561 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:58,061 INFO L93 Difference]: Finished difference Result 768 states and 1113 transitions. [2024-11-19 13:43:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:43:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 13:43:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:58,068 INFO L225 Difference]: With dead ends: 768 [2024-11-19 13:43:58,068 INFO L226 Difference]: Without dead ends: 766 [2024-11-19 13:43:58,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:43:58,072 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 529 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:58,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1606 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:43:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-19 13:43:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 395. [2024-11-19 13:43:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4641909814323608) internal successors, (552), 389 states have internal predecessors, (552), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 13:43:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2024-11-19 13:43:58,113 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 7 [2024-11-19 13:43:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:58,114 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2024-11-19 13:43:58,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2024-11-19 13:43:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 13:43:58,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:58,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:58,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 13:43:58,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:43:58,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:58,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1584338109, now seen corresponding path program 1 times [2024-11-19 13:43:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645966842] [2024-11-19 13:43:58,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:58,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:43:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645966842] [2024-11-19 13:43:58,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645966842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:58,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:58,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:43:58,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838628266] [2024-11-19 13:43:58,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:58,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:43:58,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:43:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:43:58,738 INFO L87 Difference]: Start difference. First operand 395 states and 568 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:58,873 INFO L93 Difference]: Finished difference Result 945 states and 1374 transitions. [2024-11-19 13:43:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:43:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-19 13:43:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:58,879 INFO L225 Difference]: With dead ends: 945 [2024-11-19 13:43:58,879 INFO L226 Difference]: Without dead ends: 765 [2024-11-19 13:43:58,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:43:58,884 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 530 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:58,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1613 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:43:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-19 13:43:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 395. [2024-11-19 13:43:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4615384615384615) internal successors, (551), 389 states have internal predecessors, (551), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 13:43:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 567 transitions. [2024-11-19 13:43:58,913 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 567 transitions. Word has length 64 [2024-11-19 13:43:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:58,913 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 567 transitions. [2024-11-19 13:43:58,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 567 transitions. [2024-11-19 13:43:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 13:43:58,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:58,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:43:58,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:58,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 205854116, now seen corresponding path program 1 times [2024-11-19 13:43:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875697262] [2024-11-19 13:43:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:43:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:59,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875697262] [2024-11-19 13:43:59,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875697262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:59,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:59,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 13:43:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900783318] [2024-11-19 13:43:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:59,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:43:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:43:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:43:59,179 INFO L87 Difference]: Start difference. First operand 395 states and 567 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:59,268 INFO L93 Difference]: Finished difference Result 785 states and 1129 transitions. [2024-11-19 13:43:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:43:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 13:43:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:59,272 INFO L225 Difference]: With dead ends: 785 [2024-11-19 13:43:59,272 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 13:43:59,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:43:59,274 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 87 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:59,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2027 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:43:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 13:43:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2024-11-19 13:43:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.442970822281167) internal successors, (544), 389 states have internal predecessors, (544), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 13:43:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 560 transitions. [2024-11-19 13:43:59,286 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 560 transitions. Word has length 81 [2024-11-19 13:43:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:59,286 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 560 transitions. [2024-11-19 13:43:59,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 560 transitions. [2024-11-19 13:43:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 13:43:59,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:59,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:59,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 13:43:59,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:59,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 774993816, now seen corresponding path program 1 times [2024-11-19 13:43:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698079575] [2024-11-19 13:43:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 13:43:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698079575] [2024-11-19 13:43:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698079575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:59,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:59,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:43:59,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512260411] [2024-11-19 13:43:59,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:59,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:43:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:59,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:43:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:43:59,471 INFO L87 Difference]: Start difference. First operand 395 states and 560 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:59,537 INFO L93 Difference]: Finished difference Result 1063 states and 1530 transitions. [2024-11-19 13:43:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:43:59,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-19 13:43:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:59,545 INFO L225 Difference]: With dead ends: 1063 [2024-11-19 13:43:59,545 INFO L226 Difference]: Without dead ends: 676 [2024-11-19 13:43:59,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:43:59,553 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 353 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:59,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1289 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:43:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-19 13:43:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 672. [2024-11-19 13:43:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 649 states have (on average 1.4637904468412943) internal successors, (950), 666 states have internal predecessors, (950), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 13:43:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 976 transitions. [2024-11-19 13:43:59,578 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 976 transitions. Word has length 81 [2024-11-19 13:43:59,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:59,579 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 976 transitions. [2024-11-19 13:43:59,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 13:43:59,579 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 976 transitions. [2024-11-19 13:43:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 13:43:59,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:59,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:59,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 13:43:59,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:59,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:59,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1034787715, now seen corresponding path program 1 times [2024-11-19 13:43:59,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586384194] [2024-11-19 13:43:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:43:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 13:43:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:43:59,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586384194] [2024-11-19 13:43:59,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586384194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:43:59,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:43:59,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:43:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913754711] [2024-11-19 13:43:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:43:59,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:43:59,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:43:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:43:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:43:59,748 INFO L87 Difference]: Start difference. First operand 672 states and 976 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:43:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:43:59,803 INFO L93 Difference]: Finished difference Result 1278 states and 1862 transitions. [2024-11-19 13:43:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:43:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-19 13:43:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:43:59,806 INFO L225 Difference]: With dead ends: 1278 [2024-11-19 13:43:59,807 INFO L226 Difference]: Without dead ends: 684 [2024-11-19 13:43:59,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:43:59,811 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:43:59,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1074 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:43:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-19 13:43:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2024-11-19 13:43:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 661 states have (on average 1.4553706505295008) internal successors, (962), 678 states have internal predecessors, (962), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 13:43:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 988 transitions. [2024-11-19 13:43:59,831 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 988 transitions. Word has length 96 [2024-11-19 13:43:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:43:59,832 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 988 transitions. [2024-11-19 13:43:59,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:43:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 988 transitions. [2024-11-19 13:43:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 13:43:59,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:43:59,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:43:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:43:59,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:43:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:43:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 651392123, now seen corresponding path program 1 times [2024-11-19 13:43:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:43:59,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970713756] [2024-11-19 13:43:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:43:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:43:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:44:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 13:44:00,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:44:00,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970713756] [2024-11-19 13:44:00,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970713756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:44:00,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:44:00,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:44:00,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916641219] [2024-11-19 13:44:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:44:00,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:44:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:44:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:44:00,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:44:00,168 INFO L87 Difference]: Start difference. First operand 684 states and 988 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:44:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:44:00,273 INFO L93 Difference]: Finished difference Result 946 states and 1369 transitions. [2024-11-19 13:44:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:44:00,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-19 13:44:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:44:00,279 INFO L225 Difference]: With dead ends: 946 [2024-11-19 13:44:00,279 INFO L226 Difference]: Without dead ends: 944 [2024-11-19 13:44:00,280 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-11-19 13:44:00,281 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 437 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:44:00,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1677 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:44:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-19 13:44:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 748. [2024-11-19 13:44:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 722 states have (on average 1.440443213296399) internal successors, (1040), 739 states have internal predecessors, (1040), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:44:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1072 transitions. [2024-11-19 13:44:00,306 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1072 transitions. Word has length 96 [2024-11-19 13:44:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:44:00,306 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1072 transitions. [2024-11-19 13:44:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:44:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1072 transitions. [2024-11-19 13:44:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 13:44:00,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:44:00,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:44:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 13:44:00,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:44:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:44:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1513670566, now seen corresponding path program 1 times [2024-11-19 13:44:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:44:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93654120] [2024-11-19 13:44:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:44:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:44:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:44:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:44:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:44:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93654120] [2024-11-19 13:44:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93654120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:44:00,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41644265] [2024-11-19 13:44:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:44:00,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:44:00,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:44:00,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:44:00,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 13:44:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:44:01,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 13:44:01,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:44:01,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 13:44:01,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 13:44:01,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 13:44:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 13:44:01,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:44:01,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41644265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:44:01,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:44:01,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 13:44:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343768327] [2024-11-19 13:44:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:44:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 13:44:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:44:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 13:44:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:44:01,925 INFO L87 Difference]: Start difference. First operand 748 states and 1072 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:44:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:44:04,122 INFO L93 Difference]: Finished difference Result 1635 states and 2355 transitions. [2024-11-19 13:44:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 13:44:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-19 13:44:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:44:04,127 INFO L225 Difference]: With dead ends: 1635 [2024-11-19 13:44:04,127 INFO L226 Difference]: Without dead ends: 981 [2024-11-19 13:44:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 13:44:04,130 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 788 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 13:44:04,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 3944 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 13:44:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-19 13:44:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 780. [2024-11-19 13:44:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 754 states have (on average 1.4283819628647214) internal successors, (1077), 771 states have internal predecessors, (1077), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:44:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1109 transitions. [2024-11-19 13:44:04,155 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1109 transitions. Word has length 102 [2024-11-19 13:44:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:44:04,155 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1109 transitions. [2024-11-19 13:44:04,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 13:44:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1109 transitions. [2024-11-19 13:44:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 13:44:04,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:44:04,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 13:44:04,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 13:44:04,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 13:44:04,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 13:44:04,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:44:04,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1251628595, now seen corresponding path program 1 times [2024-11-19 13:44:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:44:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988583322] [2024-11-19 13:44:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:44:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:44:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:44:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 13:44:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:44:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988583322] [2024-11-19 13:44:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988583322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:44:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490578369] [2024-11-19 13:44:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:44:04,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:44:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:44:04,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 13:44:04,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 13:44:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:44:05,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 13:44:05,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:44:23,555 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 13:45:13,335 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 13:45:21,241 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)