./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-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 c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:10:09,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:10:09,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:10:09,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:10:09,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:10:10,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:10:10,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:10:10,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:10:10,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:10:10,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:10:10,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:10:10,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:10:10,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:10:10,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:10:10,012 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:10:10,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:10:10,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:10:10,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:10:10,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:10:10,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:10:10,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:10:10,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:10:10,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:10:10,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:10:10,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:10:10,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:10:10,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:10:10,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:10:10,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:10:10,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:10:10,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:10:10,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:10:10,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:10:10,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:10:10,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:10:10,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:10:10,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:10:10,019 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 -> c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b [2024-10-13 09:10:10,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:10:10,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:10:10,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:10:10,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:10:10,262 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:10:10,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2024-10-13 09:10:11,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:10:11,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:10:11,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2024-10-13 09:10:11,909 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910508325/741c8044f9d94dc3af2a9e1f7adad9bb/FLAGfc3738236 [2024-10-13 09:10:12,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910508325/741c8044f9d94dc3af2a9e1f7adad9bb [2024-10-13 09:10:12,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:10:12,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:10:12,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:10:12,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:10:12,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:10:12,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:12,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3deaecc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12, skipping insertion in model container [2024-10-13 09:10:12,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:12,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:10:12,611 WARN L248 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_FNV_test5-2.i[33021,33034] [2024-10-13 09:10:12,749 WARN L248 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_FNV_test5-2.i[49681,49694] [2024-10-13 09:10:12,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:10:12,769 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:10:12,802 WARN L248 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_FNV_test5-2.i[33021,33034] [2024-10-13 09:10:12,905 WARN L248 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_FNV_test5-2.i[49681,49694] [2024-10-13 09:10:12,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:10:12,942 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:10:12,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12 WrapperNode [2024-10-13 09:10:12,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:10:12,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:10:12,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:10:12,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:10:12,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:12,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,075 INFO L138 Inliner]: procedures = 177, calls = 424, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2202 [2024-10-13 09:10:13,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:10:13,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:10:13,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:10:13,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:10:13,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,196 INFO L175 MemorySlicer]: Split 397 memory accesses to 3 slices as follows [24, 2, 371]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 91 writes are split as follows [1, 0, 90]. [2024-10-13 09:10:13,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:10:13,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:10:13,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:10:13,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:10:13,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (1/1) ... [2024-10-13 09:10:13,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:10:13,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:10:13,316 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-10-13 09:10:13,319 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-10-13 09:10:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:10:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:10:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:10:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:10:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:10:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:10:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:10:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:10:13,358 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:10:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:10:13,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:10:13,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:10:13,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:10:13,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:10:15,166 INFO L? ?]: Removed 510 outVars from TransFormulas that were not future-live. [2024-10-13 09:10:15,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:10:15,233 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:10:15,234 INFO L314 CfgBuilder]: Removed 92 assume(true) statements. [2024-10-13 09:10:15,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:15 BoogieIcfgContainer [2024-10-13 09:10:15,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:10:15,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:10:15,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:10:15,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:10:15,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:12" (1/3) ... [2024-10-13 09:10:15,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f5093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:15, skipping insertion in model container [2024-10-13 09:10:15,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:12" (2/3) ... [2024-10-13 09:10:15,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f5093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:15, skipping insertion in model container [2024-10-13 09:10:15,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:15" (3/3) ... [2024-10-13 09:10:15,242 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-2.i [2024-10-13 09:10:15,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:10:15,256 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 09:10:15,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:10:15,324 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;@4cdb0971, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:10:15,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 09:10:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 598 states, 582 states have (on average 1.6305841924398625) internal successors, (949), 589 states have internal predecessors, (949), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:10:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:10:15,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:15,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:15,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:15,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1758022370, now seen corresponding path program 1 times [2024-10-13 09:10:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:15,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725028214] [2024-10-13 09:10:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:10:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725028214] [2024-10-13 09:10:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725028214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:10:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:10:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790565081] [2024-10-13 09:10:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:15,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:10:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:15,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:10:15,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:10:15,549 INFO L87 Difference]: Start difference. First operand has 598 states, 582 states have (on average 1.6305841924398625) internal successors, (949), 589 states have internal predecessors, (949), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:15,719 INFO L93 Difference]: Finished difference Result 1746 states and 2854 transitions. [2024-10-13 09:10:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:10:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 09:10:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:15,747 INFO L225 Difference]: With dead ends: 1746 [2024-10-13 09:10:15,748 INFO L226 Difference]: Without dead ends: 1113 [2024-10-13 09:10:15,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:10:15,760 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 786 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:15,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1762 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:10:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-13 09:10:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 563. [2024-10-13 09:10:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 548 states have (on average 1.4598540145985401) internal successors, (800), 554 states have internal predecessors, (800), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:10:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 822 transitions. [2024-10-13 09:10:15,845 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 822 transitions. Word has length 7 [2024-10-13 09:10:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 822 transitions. [2024-10-13 09:10:15,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 822 transitions. [2024-10-13 09:10:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 09:10:15,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:15,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:15,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:10:15,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:15,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2027465656, now seen corresponding path program 1 times [2024-10-13 09:10:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574954676] [2024-10-13 09:10:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:10:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574954676] [2024-10-13 09:10:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574954676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:10:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:10:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021687030] [2024-10-13 09:10:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:10:16,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:10:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:10:16,522 INFO L87 Difference]: Start difference. First operand 563 states and 822 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:16,653 INFO L93 Difference]: Finished difference Result 1082 states and 1576 transitions. [2024-10-13 09:10:16,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:10:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 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 207 [2024-10-13 09:10:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:16,659 INFO L225 Difference]: With dead ends: 1082 [2024-10-13 09:10:16,659 INFO L226 Difference]: Without dead ends: 521 [2024-10-13 09:10:16,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:10:16,662 INFO L432 NwaCegarLoop]: 716 mSDtfsCounter, 30 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:16,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2131 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:10:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-13 09:10:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2024-10-13 09:10:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 506 states have (on average 1.4288537549407114) internal successors, (723), 512 states have internal predecessors, (723), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:10:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 745 transitions. [2024-10-13 09:10:16,687 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 745 transitions. Word has length 207 [2024-10-13 09:10:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:16,688 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 745 transitions. [2024-10-13 09:10:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 745 transitions. [2024-10-13 09:10:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-13 09:10:16,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:16,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:16,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:10:16,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:16,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:16,697 INFO L85 PathProgramCache]: Analyzing trace with hash 487916204, now seen corresponding path program 1 times [2024-10-13 09:10:16,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:16,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436656219] [2024-10-13 09:10:16,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:16,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:10:16,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:16,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436656219] [2024-10-13 09:10:16,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436656219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:16,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:10:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:10:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317362664] [2024-10-13 09:10:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:10:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:10:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:10:16,941 INFO L87 Difference]: Start difference. First operand 521 states and 745 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:16,994 INFO L93 Difference]: Finished difference Result 1127 states and 1607 transitions. [2024-10-13 09:10:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:10:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 207 [2024-10-13 09:10:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:17,000 INFO L225 Difference]: With dead ends: 1127 [2024-10-13 09:10:17,000 INFO L226 Difference]: Without dead ends: 608 [2024-10-13 09:10:17,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:10:17,002 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 58 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:17,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1462 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:10:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-13 09:10:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-13 09:10:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 593 states have (on average 1.418212478920742) internal successors, (841), 599 states have internal predecessors, (841), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:10:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 863 transitions. [2024-10-13 09:10:17,020 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 863 transitions. Word has length 207 [2024-10-13 09:10:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 863 transitions. [2024-10-13 09:10:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:10:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 863 transitions. [2024-10-13 09:10:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-13 09:10:17,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:17,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:17,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:10:17,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash -515655873, now seen corresponding path program 1 times [2024-10-13 09:10:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749075685] [2024-10-13 09:10:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:10:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:17,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749075685] [2024-10-13 09:10:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749075685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:17,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:10:17,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:10:17,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677647277] [2024-10-13 09:10:17,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:17,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:10:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:10:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:10:17,443 INFO L87 Difference]: Start difference. First operand 608 states and 863 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:10:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:17,865 INFO L93 Difference]: Finished difference Result 1087 states and 1548 transitions. [2024-10-13 09:10:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:10:17,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 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 220 [2024-10-13 09:10:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:17,868 INFO L225 Difference]: With dead ends: 1087 [2024-10-13 09:10:17,868 INFO L226 Difference]: Without dead ends: 568 [2024-10-13 09:10:17,872 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-10-13 09:10:17,873 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 37 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:17,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2374 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:10:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-13 09:10:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2024-10-13 09:10:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 551 states have (on average 1.3865698729582576) internal successors, (764), 557 states have internal predecessors, (764), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 09:10:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 786 transitions. [2024-10-13 09:10:17,893 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 786 transitions. Word has length 220 [2024-10-13 09:10:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:17,894 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 786 transitions. [2024-10-13 09:10:17,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 4 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:10:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 786 transitions. [2024-10-13 09:10:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-13 09:10:17,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:17,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:10:17,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 983914955, now seen corresponding path program 1 times [2024-10-13 09:10:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779073130] [2024-10-13 09:10:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:10:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779073130] [2024-10-13 09:10:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779073130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:10:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:10:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398145728] [2024-10-13 09:10:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:10:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:10:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:10:18,168 INFO L87 Difference]: Start difference. First operand 566 states and 786 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:10:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:18,669 INFO L93 Difference]: Finished difference Result 1337 states and 1884 transitions. [2024-10-13 09:10:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:10:18,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 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 220 [2024-10-13 09:10:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:18,674 INFO L225 Difference]: With dead ends: 1337 [2024-10-13 09:10:18,676 INFO L226 Difference]: Without dead ends: 860 [2024-10-13 09:10:18,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:10:18,680 INFO L432 NwaCegarLoop]: 840 mSDtfsCounter, 385 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:18,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 2200 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:10:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-10-13 09:10:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 856. [2024-10-13 09:10:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 833 states have (on average 1.3997599039615847) internal successors, (1166), 844 states have internal predecessors, (1166), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 09:10:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1204 transitions. [2024-10-13 09:10:18,705 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1204 transitions. Word has length 220 [2024-10-13 09:10:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:18,705 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1204 transitions. [2024-10-13 09:10:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:10:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1204 transitions. [2024-10-13 09:10:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 09:10:18,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:18,707 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:10:18,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:18,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:18,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2141314094, now seen corresponding path program 1 times [2024-10-13 09:10:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656467206] [2024-10-13 09:10:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 09:10:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 09:10:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656467206] [2024-10-13 09:10:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656467206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:10:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980045160] [2024-10-13 09:10:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:19,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:19,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:10:19,096 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-10-13 09:10:19,102 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-10-13 09:10:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:19,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 09:10:19,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:10:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 09:10:19,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:10:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980045160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:10:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 09:10:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335452085] [2024-10-13 09:10:19,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:10:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:19,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:10:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:10:19,575 INFO L87 Difference]: Start difference. First operand 856 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 09:10:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:19,645 INFO L93 Difference]: Finished difference Result 1213 states and 1742 transitions. [2024-10-13 09:10:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:10:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-13 09:10:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:19,649 INFO L225 Difference]: With dead ends: 1213 [2024-10-13 09:10:19,649 INFO L226 Difference]: Without dead ends: 896 [2024-10-13 09:10:19,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:10:19,651 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 8 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:19,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1250 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:10:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-13 09:10:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-10-13 09:10:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 873 states have (on average 1.3814432989690721) internal successors, (1206), 884 states have internal predecessors, (1206), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 09:10:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1244 transitions. [2024-10-13 09:10:19,677 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1244 transitions. Word has length 233 [2024-10-13 09:10:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:19,678 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1244 transitions. [2024-10-13 09:10:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 09:10:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1244 transitions. [2024-10-13 09:10:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 09:10:19,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:19,681 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:19,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:10:19,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 09:10:19,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:19,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -769506796, now seen corresponding path program 1 times [2024-10-13 09:10:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436875819] [2024-10-13 09:10:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 09:10:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 09:10:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436875819] [2024-10-13 09:10:20,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436875819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:10:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196136693] [2024-10-13 09:10:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:10:20,247 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-10-13 09:10:20,248 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-10-13 09:10:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:20,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 09:10:20,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:10:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 09:10:20,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:10:20,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196136693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:10:20,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:10:20,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-13 09:10:20,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695077508] [2024-10-13 09:10:20,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:10:20,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:10:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:20,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:10:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:10:20,747 INFO L87 Difference]: Start difference. First operand 896 states and 1244 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 09:10:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:20,819 INFO L93 Difference]: Finished difference Result 1225 states and 1734 transitions. [2024-10-13 09:10:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:10:20,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2024-10-13 09:10:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:20,824 INFO L225 Difference]: With dead ends: 1225 [2024-10-13 09:10:20,824 INFO L226 Difference]: Without dead ends: 868 [2024-10-13 09:10:20,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:10:20,826 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 105 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:20,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1781 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:10:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-13 09:10:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2024-10-13 09:10:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 856 states have internal predecessors, (1164), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 09:10:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1202 transitions. [2024-10-13 09:10:20,843 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1202 transitions. Word has length 233 [2024-10-13 09:10:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:20,844 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1202 transitions. [2024-10-13 09:10:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 09:10:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1202 transitions. [2024-10-13 09:10:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 09:10:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:20,846 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:20,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:10:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-13 09:10:21,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 982139078, now seen corresponding path program 1 times [2024-10-13 09:10:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040850782] [2024-10-13 09:10:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 09:10:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 09:10:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040850782] [2024-10-13 09:10:21,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040850782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:10:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17187994] [2024-10-13 09:10:21,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:21,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:10:21,374 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-10-13 09:10:21,375 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-10-13 09:10:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:21,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 09:10:21,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:10:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:21,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:10:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:22,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17187994] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:10:22,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:10:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-13 09:10:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100374478] [2024-10-13 09:10:22,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:10:22,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:10:22,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:22,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:10:22,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:10:22,215 INFO L87 Difference]: Start difference. First operand 868 states and 1202 transitions. Second operand has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 09:10:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:22,756 INFO L93 Difference]: Finished difference Result 2375 states and 3348 transitions. [2024-10-13 09:10:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:10:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2024-10-13 09:10:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:22,763 INFO L225 Difference]: With dead ends: 2375 [2024-10-13 09:10:22,764 INFO L226 Difference]: Without dead ends: 2045 [2024-10-13 09:10:22,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:10:22,767 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1908 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:22,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 3537 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:10:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-10-13 09:10:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1531. [2024-10-13 09:10:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1493 states have (on average 1.3563295378432685) internal successors, (2025), 1504 states have internal predecessors, (2025), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 26 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 09:10:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2093 transitions. [2024-10-13 09:10:22,807 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2093 transitions. Word has length 233 [2024-10-13 09:10:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:22,808 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 2093 transitions. [2024-10-13 09:10:22,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.875) internal successors, (535), 7 states have internal predecessors, (535), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 09:10:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2093 transitions. [2024-10-13 09:10:22,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2024-10-13 09:10:22,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:22,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:22,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 09:10:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:23,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1275981749, now seen corresponding path program 1 times [2024-10-13 09:10:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272204087] [2024-10-13 09:10:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:10:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 09:10:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 09:10:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:24,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 09:10:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 09:10:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 4 proven. 534 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-10-13 09:10:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:10:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272204087] [2024-10-13 09:10:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272204087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:10:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114927809] [2024-10-13 09:10:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:24,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:24,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:10:24,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:10:24,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 09:10:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:10:25,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 09:10:25,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:10:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:25,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:10:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 09:10:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114927809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:10:26,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:10:26,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-13 09:10:26,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107826128] [2024-10-13 09:10:26,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:10:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 09:10:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:10:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 09:10:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-10-13 09:10:26,544 INFO L87 Difference]: Start difference. First operand 1531 states and 2093 transitions. Second operand has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 09:10:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:10:33,530 INFO L93 Difference]: Finished difference Result 15706 states and 22067 transitions. [2024-10-13 09:10:33,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-13 09:10:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 671 [2024-10-13 09:10:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:10:33,590 INFO L225 Difference]: With dead ends: 15706 [2024-10-13 09:10:33,590 INFO L226 Difference]: Without dead ends: 14710 [2024-10-13 09:10:33,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1408 GetRequests, 1339 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1242, Invalid=3728, Unknown=0, NotChecked=0, Total=4970 [2024-10-13 09:10:33,601 INFO L432 NwaCegarLoop]: 1479 mSDtfsCounter, 32055 mSDsluCounter, 16630 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32055 SdHoareTripleChecker+Valid, 18109 SdHoareTripleChecker+Invalid, 3540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:10:33,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32055 Valid, 18109 Invalid, 3540 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [575 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-13 09:10:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2024-10-13 09:10:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 8302. [2024-10-13 09:10:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8302 states, 8172 states have (on average 1.3461820851688693) internal successors, (11001), 8188 states have internal predecessors, (11001), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-13 09:10:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8302 states to 8302 states and 11253 transitions. [2024-10-13 09:10:33,874 INFO L78 Accepts]: Start accepts. Automaton has 8302 states and 11253 transitions. Word has length 671 [2024-10-13 09:10:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:10:33,875 INFO L471 AbstractCegarLoop]: Abstraction has 8302 states and 11253 transitions. [2024-10-13 09:10:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 98.05882352941177) internal successors, (1667), 16 states have internal predecessors, (1667), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 09:10:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8302 states and 11253 transitions. [2024-10-13 09:10:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2024-10-13 09:10:33,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:10:33,915 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:10:33,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 09:10:34,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:10:34,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:10:34,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:10:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 681191305, now seen corresponding path program 1 times [2024-10-13 09:10:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:10:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296078491] [2024-10-13 09:10:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:10:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms