./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_BER_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 22:49:16,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 22:49:16,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 22:49:16,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 22:49:16,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 22:49:16,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 22:49:16,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 22:49:16,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 22:49:16,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 22:49:16,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 22:49:16,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 22:49:16,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 22:49:16,182 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 22:49:16,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 22:49:16,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 22:49:16,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 22:49:16,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 22:49:16,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 22:49:16,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 22:49:16,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 22:49:16,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 22:49:16,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 22:49:16,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 22:49:16,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 22:49:16,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 22:49:16,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 22:49:16,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 22:49:16,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 22:49:16,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 22:49:16,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 22:49:16,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 22:49:16,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 22:49:16,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:49:16,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 22:49:16,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 22:49:16,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 22:49:16,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 22:49:16,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 22:49:16,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 22:49:16,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 22:49:16,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 22:49:16,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 22:49:16,194 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 ! call(reach_error())) ) 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-16 22:49:16,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 22:49:16,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 22:49:16,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 22:49:16,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 22:49:16,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 22:49:16,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-16 22:49:17,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 22:49:18,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 22:49:18,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-16 22:49:18,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4296657/e46528d9d6e84938b3da61382456ec9d/FLAG4f5608608 [2024-11-16 22:49:18,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4296657/e46528d9d6e84938b3da61382456ec9d [2024-11-16 22:49:18,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 22:49:18,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 22:49:18,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 22:49:18,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 22:49:18,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 22:49:18,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:18" (1/1) ... [2024-11-16 22:49:18,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400f9695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:18, skipping insertion in model container [2024-11-16 22:49:18,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:49:18" (1/1) ... [2024-11-16 22:49:18,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 22:49:18,757 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i[37435,37448] [2024-11-16 22:49:18,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:49:18,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 22:49:18,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i[37435,37448] [2024-11-16 22:49:19,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:49:19,177 INFO L204 MainTranslator]: Completed translation [2024-11-16 22:49:19,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19 WrapperNode [2024-11-16 22:49:19,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 22:49:19,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 22:49:19,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 22:49:19,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 22:49:19,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,298 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1408 [2024-11-16 22:49:19,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 22:49:19,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 22:49:19,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 22:49:19,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 22:49:19,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,445 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [218, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-16 22:49:19,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 22:49:19,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 22:49:19,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 22:49:19,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 22:49:19,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (1/1) ... [2024-11-16 22:49:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:49:19,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:19,558 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-16 22:49:19,562 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-16 22:49:19,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 22:49:19,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 22:49:19,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 22:49:19,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 22:49:19,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 22:49:19,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 22:49:19,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 22:49:19,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 22:49:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 22:49:19,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 22:49:19,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 22:49:19,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 22:49:19,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 22:49:19,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 22:49:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 22:49:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 22:49:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 22:49:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 22:49:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 22:49:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 22:49:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 22:49:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 22:49:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 22:49:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 22:49:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 22:49:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 22:49:19,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 22:49:19,852 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 22:49:19,854 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 22:49:21,085 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 22:49:21,182 INFO L? ?]: Removed 320 outVars from TransFormulas that were not future-live. [2024-11-16 22:49:21,182 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 22:49:21,289 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 22:49:21,293 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 22:49:21,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:21 BoogieIcfgContainer [2024-11-16 22:49:21,294 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 22:49:21,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 22:49:21,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 22:49:21,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 22:49:21,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:49:18" (1/3) ... [2024-11-16 22:49:21,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7400c13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:21, skipping insertion in model container [2024-11-16 22:49:21,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:49:19" (2/3) ... [2024-11-16 22:49:21,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7400c13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:49:21, skipping insertion in model container [2024-11-16 22:49:21,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:49:21" (3/3) ... [2024-11-16 22:49:21,309 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-2.i [2024-11-16 22:49:21,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 22:49:21,355 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 22:49:21,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 22:49:21,432 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;@73d6274a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 22:49:21,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 22:49:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 398 states have (on average 1.6155778894472361) internal successors, (643), 399 states have internal predecessors, (643), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 22:49:21,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:21,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:49:21,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:21,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash -856619657, now seen corresponding path program 1 times [2024-11-16 22:49:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14022794] [2024-11-16 22:49:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:21,649 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-16 22:49:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14022794] [2024-11-16 22:49:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14022794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:21,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 22:49:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666003771] [2024-11-16 22:49:21,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 22:49:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:21,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 22:49:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:49:21,694 INFO L87 Difference]: Start difference. First operand has 404 states, 398 states have (on average 1.6155778894472361) internal successors, (643), 399 states have internal predecessors, (643), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 22:49:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:21,818 INFO L93 Difference]: Finished difference Result 805 states and 1294 transitions. [2024-11-16 22:49:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 22:49:21,821 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-16 22:49:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:21,833 INFO L225 Difference]: With dead ends: 805 [2024-11-16 22:49:21,835 INFO L226 Difference]: Without dead ends: 365 [2024-11-16 22:49:21,842 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-16 22:49:21,846 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:21,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 539 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:49:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-16 22:49:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-16 22:49:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.45) internal successors, (522), 360 states have internal predecessors, (522), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 528 transitions. [2024-11-16 22:49:21,908 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 528 transitions. Word has length 11 [2024-11-16 22:49:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:21,909 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 528 transitions. [2024-11-16 22:49:21,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 22:49:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 528 transitions. [2024-11-16 22:49:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 22:49:21,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:21,914 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] [2024-11-16 22:49:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 22:49:21,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1903405487, now seen corresponding path program 1 times [2024-11-16 22:49:21,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482798845] [2024-11-16 22:49:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:22,262 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-16 22:49:22,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:22,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482798845] [2024-11-16 22:49:22,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482798845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:22,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:22,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:49:22,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954401201] [2024-11-16 22:49:22,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:22,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:22,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:49:22,267 INFO L87 Difference]: Start difference. First operand 365 states and 528 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-16 22:49:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:22,449 INFO L93 Difference]: Finished difference Result 483 states and 697 transitions. [2024-11-16 22:49:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:49:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2024-11-16 22:49:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:22,453 INFO L225 Difference]: With dead ends: 483 [2024-11-16 22:49:22,454 INFO L226 Difference]: Without dead ends: 323 [2024-11-16 22:49:22,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:49:22,456 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 30 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:22,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1162 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:49:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-16 22:49:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-16 22:49:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.39937106918239) internal successors, (445), 318 states have internal predecessors, (445), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2024-11-16 22:49:22,478 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 67 [2024-11-16 22:49:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:22,478 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2024-11-16 22:49:22,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-16 22:49:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2024-11-16 22:49:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 22:49:22,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:22,482 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] [2024-11-16 22:49:22,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 22:49:22,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash -522698216, now seen corresponding path program 1 times [2024-11-16 22:49:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071850886] [2024-11-16 22:49:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:22,622 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-16 22:49:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071850886] [2024-11-16 22:49:22,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071850886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:22,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:22,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 22:49:22,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010618915] [2024-11-16 22:49:22,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:22,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 22:49:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:22,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 22:49:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:49:22,626 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-16 22:49:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:22,731 INFO L93 Difference]: Finished difference Result 441 states and 609 transitions. [2024-11-16 22:49:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 22:49:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2024-11-16 22:49:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:22,733 INFO L225 Difference]: With dead ends: 441 [2024-11-16 22:49:22,733 INFO L226 Difference]: Without dead ends: 323 [2024-11-16 22:49:22,734 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-16 22:49:22,735 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 1 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:22,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 792 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:49:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-16 22:49:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-11-16 22:49:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.389937106918239) internal successors, (442), 318 states have internal predecessors, (442), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2024-11-16 22:49:22,764 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 67 [2024-11-16 22:49:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2024-11-16 22:49:22,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-16 22:49:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2024-11-16 22:49:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 22:49:22,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:22,767 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] [2024-11-16 22:49:22,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 22:49:22,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:22,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1660978711, now seen corresponding path program 1 times [2024-11-16 22:49:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636501698] [2024-11-16 22:49:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:23,270 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-16 22:49:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636501698] [2024-11-16 22:49:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636501698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:23,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:23,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 22:49:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429680501] [2024-11-16 22:49:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:23,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 22:49:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 22:49:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 22:49:23,273 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-16 22:49:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:23,519 INFO L93 Difference]: Finished difference Result 759 states and 1046 transitions. [2024-11-16 22:49:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:49:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 67 [2024-11-16 22:49:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:23,524 INFO L225 Difference]: With dead ends: 759 [2024-11-16 22:49:23,524 INFO L226 Difference]: Without dead ends: 638 [2024-11-16 22:49:23,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 22:49:23,525 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 431 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:23,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1717 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:49:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-16 22:49:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 325. [2024-11-16 22:49:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.3875) internal successors, (444), 320 states have internal predecessors, (444), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 450 transitions. [2024-11-16 22:49:23,545 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 450 transitions. Word has length 67 [2024-11-16 22:49:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:23,545 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 450 transitions. [2024-11-16 22:49:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-16 22:49:23,546 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 450 transitions. [2024-11-16 22:49:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 22:49:23,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:23,552 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 22:49:23,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1752527859, now seen corresponding path program 1 times [2024-11-16 22:49:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539340299] [2024-11-16 22:49:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:49:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:23,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539340299] [2024-11-16 22:49:23,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539340299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:49:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574438159] [2024-11-16 22:49:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:49:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:49:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:49:23,859 INFO L87 Difference]: Start difference. First operand 325 states and 450 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-16 22:49:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:23,999 INFO L93 Difference]: Finished difference Result 648 states and 898 transitions. [2024-11-16 22:49:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:49:23,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 144 [2024-11-16 22:49:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:24,001 INFO L225 Difference]: With dead ends: 648 [2024-11-16 22:49:24,001 INFO L226 Difference]: Without dead ends: 328 [2024-11-16 22:49:24,002 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-16 22:49:24,003 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 105 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:24,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1070 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:49:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-16 22:49:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2024-11-16 22:49:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.365625) internal successors, (437), 320 states have internal predecessors, (437), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 443 transitions. [2024-11-16 22:49:24,012 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 443 transitions. Word has length 144 [2024-11-16 22:49:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:24,014 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 443 transitions. [2024-11-16 22:49:24,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-16 22:49:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 443 transitions. [2024-11-16 22:49:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 22:49:24,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:24,017 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:24,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 22:49:24,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:24,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash -888203372, now seen corresponding path program 1 times [2024-11-16 22:49:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468956541] [2024-11-16 22:49:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:49:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468956541] [2024-11-16 22:49:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468956541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:24,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 22:49:24,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823287018] [2024-11-16 22:49:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 22:49:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 22:49:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:49:24,216 INFO L87 Difference]: Start difference. First operand 325 states and 443 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-16 22:49:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:24,353 INFO L93 Difference]: Finished difference Result 871 states and 1196 transitions. [2024-11-16 22:49:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 22:49:24,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 144 [2024-11-16 22:49:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:24,356 INFO L225 Difference]: With dead ends: 871 [2024-11-16 22:49:24,357 INFO L226 Difference]: Without dead ends: 551 [2024-11-16 22:49:24,357 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-16 22:49:24,358 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 254 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:24,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 899 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:49:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-16 22:49:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2024-11-16 22:49:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.3768382352941178) internal successors, (749), 544 states have internal predecessors, (749), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 755 transitions. [2024-11-16 22:49:24,376 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 755 transitions. Word has length 144 [2024-11-16 22:49:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:24,377 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 755 transitions. [2024-11-16 22:49:24,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-16 22:49:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 755 transitions. [2024-11-16 22:49:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 22:49:24,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:24,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:24,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 22:49:24,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1344683782, now seen corresponding path program 1 times [2024-11-16 22:49:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:24,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133482507] [2024-11-16 22:49:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:49:24,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133482507] [2024-11-16 22:49:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133482507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:24,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:49:24,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:49:24,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908936562] [2024-11-16 22:49:24,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:49:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:49:24,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:49:24,741 INFO L87 Difference]: Start difference. First operand 549 states and 755 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 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-16 22:49:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:25,163 INFO L93 Difference]: Finished difference Result 872 states and 1199 transitions. [2024-11-16 22:49:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:49:25,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 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 159 [2024-11-16 22:49:25,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:25,168 INFO L225 Difference]: With dead ends: 872 [2024-11-16 22:49:25,168 INFO L226 Difference]: Without dead ends: 458 [2024-11-16 22:49:25,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:49:25,170 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 706 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:25,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1233 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 22:49:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-16 22:49:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 455. [2024-11-16 22:49:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 450 states have (on average 1.3866666666666667) internal successors, (624), 450 states have internal predecessors, (624), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 630 transitions. [2024-11-16 22:49:25,188 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 630 transitions. Word has length 159 [2024-11-16 22:49:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:25,189 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 630 transitions. [2024-11-16 22:49:25,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 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-16 22:49:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 630 transitions. [2024-11-16 22:49:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 22:49:25,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:25,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:25,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 22:49:25,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1830782325, now seen corresponding path program 1 times [2024-11-16 22:49:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691791581] [2024-11-16 22:49:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 22:49:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691791581] [2024-11-16 22:49:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691791581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50786504] [2024-11-16 22:49:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:25,783 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-16 22:49:25,784 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-16 22:49:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:26,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 22:49:26,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:26,251 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-16 22:49:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 22:49:27,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:49:27,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50786504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:27,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:49:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-11-16 22:49:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411893796] [2024-11-16 22:49:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:27,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 22:49:27,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:27,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 22:49:27,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 22:49:27,041 INFO L87 Difference]: Start difference. First operand 455 states and 630 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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-16 22:49:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:28,141 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2024-11-16 22:49:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 22:49:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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 170 [2024-11-16 22:49:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:28,145 INFO L225 Difference]: With dead ends: 747 [2024-11-16 22:49:28,145 INFO L226 Difference]: Without dead ends: 629 [2024-11-16 22:49:28,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-11-16 22:49:28,146 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 432 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:28,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1773 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 22:49:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-16 22:49:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 493. [2024-11-16 22:49:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.3586065573770492) internal successors, (663), 488 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 669 transitions. [2024-11-16 22:49:28,163 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 669 transitions. Word has length 170 [2024-11-16 22:49:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:28,163 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 669 transitions. [2024-11-16 22:49:28,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 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-16 22:49:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 669 transitions. [2024-11-16 22:49:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 22:49:28,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:28,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:28,187 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-16 22:49:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:28,371 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:28,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2100938947, now seen corresponding path program 1 times [2024-11-16 22:49:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117230785] [2024-11-16 22:49:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 22:49:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 22:49:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 22:49:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117230785] [2024-11-16 22:49:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117230785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278744682] [2024-11-16 22:49:29,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:29,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:29,056 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-16 22:49:29,059 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-16 22:49:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:29,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 22:49:29,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:49:29,461 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-16 22:49:29,480 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 22 treesize of output 7 [2024-11-16 22:49:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:49:30,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:49:30,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278744682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:49:30,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:49:30,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-16 22:49:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810083465] [2024-11-16 22:49:30,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:49:30,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 22:49:30,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:49:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 22:49:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 22:49:30,128 INFO L87 Difference]: Start difference. First operand 493 states and 669 transitions. Second operand has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 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-16 22:49:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:49:31,865 INFO L93 Difference]: Finished difference Result 1082 states and 1465 transitions. [2024-11-16 22:49:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 22:49:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 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 171 [2024-11-16 22:49:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:49:31,869 INFO L225 Difference]: With dead ends: 1082 [2024-11-16 22:49:31,869 INFO L226 Difference]: Without dead ends: 677 [2024-11-16 22:49:31,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-16 22:49:31,871 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 697 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:49:31,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 2347 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 22:49:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-16 22:49:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 520. [2024-11-16 22:49:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 515 states have (on average 1.3495145631067962) internal successors, (695), 515 states have internal predecessors, (695), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:49:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 701 transitions. [2024-11-16 22:49:31,892 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 701 transitions. Word has length 171 [2024-11-16 22:49:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:49:31,892 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 701 transitions. [2024-11-16 22:49:31,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.909090909090908) internal successors, (164), 11 states have internal predecessors, (164), 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-16 22:49:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 701 transitions. [2024-11-16 22:49:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 22:49:31,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:49:31,895 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:49:31,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 22:49:32,095 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,SelfDestructingSolverStorable8 [2024-11-16 22:49:32,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:49:32,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:49:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1695671849, now seen corresponding path program 1 times [2024-11-16 22:49:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:49:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868714056] [2024-11-16 22:49:32,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:49:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 22:49:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 22:49:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 22:49:32,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:49:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868714056] [2024-11-16 22:49:32,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868714056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:49:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510379497] [2024-11-16 22:49:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:49:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:49:32,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:49:32,561 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-16 22:49:32,562 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-16 22:49:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:49:33,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 22:49:33,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:50:09,645 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 22:50:21,657 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 22:50:30,148 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 22:50:35,154 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)