./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_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_BER_test7-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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:22:56,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:22:56,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 16:22:56,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:22:56,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:22:56,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:22:56,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:22:56,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:22:56,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 16:22:56,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 16:22:56,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:22:56,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:22:56,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:22:56,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:22:56,467 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:22:56,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:22:56,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:22:56,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:22:56,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:22:56,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:22:56,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:22:56,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:22:56,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:22:56,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:22:56,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:22:56,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 16:22:56,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:22:56,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:22:56,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:22:56,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:22:56,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:22:56,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:22:56,479 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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2024-10-14 16:22:56,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:22:56,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:22:56,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:22:56,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:22:56,702 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:22:56,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-14 16:22:58,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:22:58,235 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:22:58,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2024-10-14 16:22:58,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48dd14ee/bee26ccaa79d4c218580e29a82f230c0/FLAGdbcb3daeb [2024-10-14 16:22:58,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48dd14ee/bee26ccaa79d4c218580e29a82f230c0 [2024-10-14 16:22:58,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:22:58,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:22:58,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:22:58,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:22:58,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:22:58,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:58,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c42a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58, skipping insertion in model container [2024-10-14 16:22:58,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:58,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:22:58,640 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_BER_test7-2.i[33021,33034] [2024-10-14 16:22:58,741 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_BER_test7-2.i[44124,44137] [2024-10-14 16:22:58,742 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_BER_test7-2.i[44245,44258] [2024-10-14 16:22:58,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:22:58,776 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:22:58,815 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_BER_test7-2.i[33021,33034] [2024-10-14 16:22:58,877 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_BER_test7-2.i[44124,44137] [2024-10-14 16:22:58,881 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_BER_test7-2.i[44245,44258] [2024-10-14 16:22:58,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:22:58,921 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:22:58,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58 WrapperNode [2024-10-14 16:22:58,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:22:58,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:22:58,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:22:58,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:22:58,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:58,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,013 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1589 [2024-10-14 16:22:59,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:22:59,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:22:59,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:22:59,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:22:59,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,140 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 34, 265]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-10-14 16:22:59,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:22:59,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:22:59,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:22:59,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:22:59,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (1/1) ... [2024-10-14 16:22:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:22:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:22:59,237 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-14 16:22:59,244 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-14 16:22:59,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 16:22:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 16:22:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 16:22:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 16:22:59,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 16:22:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 16:22:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 16:22:59,285 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 16:22:59,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:22:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 16:22:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 16:22:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 16:22:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 16:22:59,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 16:22:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 16:22:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 16:22:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 16:22:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 16:22:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 16:22:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 16:22:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:22:59,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:22:59,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:22:59,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:23:00,870 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2024-10-14 16:23:00,871 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:23:00,906 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:23:00,907 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-14 16:23:00,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:23:00 BoogieIcfgContainer [2024-10-14 16:23:00,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:23:00,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:23:00,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:23:00,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:23:00,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:22:58" (1/3) ... [2024-10-14 16:23:00,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fca65c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:23:00, skipping insertion in model container [2024-10-14 16:23:00,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:58" (2/3) ... [2024-10-14 16:23:00,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fca65c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:23:00, skipping insertion in model container [2024-10-14 16:23:00,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:23:00" (3/3) ... [2024-10-14 16:23:00,914 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2024-10-14 16:23:00,927 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:23:00,928 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 16:23:00,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:23:00,987 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;@989da91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:23:00,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 16:23:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 16:23:00,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:00,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:00,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 115030448, now seen corresponding path program 1 times [2024-10-14 16:23:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236197719] [2024-10-14 16:23:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:01,133 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-14 16:23:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236197719] [2024-10-14 16:23:01,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236197719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:01,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:01,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:23:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817962850] [2024-10-14 16:23:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:01,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:23:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:23:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:23:01,161 INFO L87 Difference]: Start difference. First operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:01,223 INFO L93 Difference]: Finished difference Result 849 states and 1377 transitions. [2024-10-14 16:23:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:23:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 16:23:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:01,244 INFO L225 Difference]: With dead ends: 849 [2024-10-14 16:23:01,244 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 16:23:01,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:23:01,249 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:01,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:23:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 16:23:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-14 16:23:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2024-10-14 16:23:01,302 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2024-10-14 16:23:01,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:01,302 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2024-10-14 16:23:01,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2024-10-14 16:23:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 16:23:01,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:01,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:01,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:23:01,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:01,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash -261640534, now seen corresponding path program 1 times [2024-10-14 16:23:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351588369] [2024-10-14 16:23:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:01,432 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-14 16:23:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:01,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351588369] [2024-10-14 16:23:01,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351588369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:01,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:01,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 16:23:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159541348] [2024-10-14 16:23:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:01,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:23:01,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:01,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:23:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:23:01,435 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-14 16:23:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:01,597 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2024-10-14 16:23:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:23:01,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-14 16:23:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:01,602 INFO L225 Difference]: With dead ends: 963 [2024-10-14 16:23:01,602 INFO L226 Difference]: Without dead ends: 773 [2024-10-14 16:23:01,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:23:01,605 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 548 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:01,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1619 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:23:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-14 16:23:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 391. [2024-10-14 16:23:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-10-14 16:23:01,631 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 9 [2024-10-14 16:23:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:01,632 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-10-14 16:23:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-14 16:23:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-10-14 16:23:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 16:23:01,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:01,635 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:01,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:23:01,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:01,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1540508619, now seen corresponding path program 1 times [2024-10-14 16:23:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380475871] [2024-10-14 16:23:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:01,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380475871] [2024-10-14 16:23:01,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380475871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:01,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:01,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:23:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312078456] [2024-10-14 16:23:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:01,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:23:01,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:01,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:23:01,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:23:01,955 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-14 16:23:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:02,034 INFO L93 Difference]: Finished difference Result 737 states and 1059 transitions. [2024-10-14 16:23:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 16:23:02,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-10-14 16:23:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:02,035 INFO L225 Difference]: With dead ends: 737 [2024-10-14 16:23:02,036 INFO L226 Difference]: Without dead ends: 349 [2024-10-14 16:23:02,036 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-14 16:23:02,037 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 30 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:02,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1357 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:23:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-14 16:23:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-14 16:23:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 343 states have (on average 1.402332361516035) internal successors, (481), 344 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2024-10-14 16:23:02,051 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 85 [2024-10-14 16:23:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:02,051 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2024-10-14 16:23:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-14 16:23:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2024-10-14 16:23:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 16:23:02,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:02,053 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:02,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:23:02,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:02,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1296227415, now seen corresponding path program 1 times [2024-10-14 16:23:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684512253] [2024-10-14 16:23:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:02,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684512253] [2024-10-14 16:23:02,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684512253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:02,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:02,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:23:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136813376] [2024-10-14 16:23:02,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:02,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:23:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:23:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:23:02,203 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-14 16:23:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:02,283 INFO L93 Difference]: Finished difference Result 949 states and 1334 transitions. [2024-10-14 16:23:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:23:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2024-10-14 16:23:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:02,286 INFO L225 Difference]: With dead ends: 949 [2024-10-14 16:23:02,286 INFO L226 Difference]: Without dead ends: 603 [2024-10-14 16:23:02,287 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-14 16:23:02,289 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 298 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:02,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:23:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-14 16:23:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2024-10-14 16:23:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 590 states have (on average 1.4186440677966101) internal successors, (837), 591 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 843 transitions. [2024-10-14 16:23:02,313 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 843 transitions. Word has length 85 [2024-10-14 16:23:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 843 transitions. [2024-10-14 16:23:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-14 16:23:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 843 transitions. [2024-10-14 16:23:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 16:23:02,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:02,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:02,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:23:02,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2070202411, now seen corresponding path program 1 times [2024-10-14 16:23:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:02,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358589252] [2024-10-14 16:23:02,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:02,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 16:23:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358589252] [2024-10-14 16:23:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358589252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:02,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:23:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700260057] [2024-10-14 16:23:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:02,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 16:23:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 16:23:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:23:02,666 INFO L87 Difference]: Start difference. First operand 596 states and 843 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-14 16:23:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:02,969 INFO L93 Difference]: Finished difference Result 880 states and 1249 transitions. [2024-10-14 16:23:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 16:23:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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 98 [2024-10-14 16:23:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:02,976 INFO L225 Difference]: With dead ends: 880 [2024-10-14 16:23:02,976 INFO L226 Difference]: Without dead ends: 876 [2024-10-14 16:23:02,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-14 16:23:02,980 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 460 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:02,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1865 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:23:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-14 16:23:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 598. [2024-10-14 16:23:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-10-14 16:23:03,000 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 98 [2024-10-14 16:23:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:03,003 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-10-14 16:23:03,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 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-14 16:23:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-10-14 16:23:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 16:23:03,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:03,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:23:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:23:03,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:03,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 91285612, now seen corresponding path program 1 times [2024-10-14 16:23:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129586528] [2024-10-14 16:23:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 16:23:03,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:03,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129586528] [2024-10-14 16:23:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129586528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:03,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 16:23:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927525213] [2024-10-14 16:23:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:03,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 16:23:03,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 16:23:03,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:23:03,312 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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-14 16:23:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:03,536 INFO L93 Difference]: Finished difference Result 865 states and 1230 transitions. [2024-10-14 16:23:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:23:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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 152 [2024-10-14 16:23:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:03,539 INFO L225 Difference]: With dead ends: 865 [2024-10-14 16:23:03,540 INFO L226 Difference]: Without dead ends: 516 [2024-10-14 16:23:03,540 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-14 16:23:03,542 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 32 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:03,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1408 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 16:23:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-14 16:23:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2024-10-14 16:23:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 508 states have (on average 1.3484251968503937) internal successors, (685), 509 states have internal predecessors, (685), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 691 transitions. [2024-10-14 16:23:03,554 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 691 transitions. Word has length 152 [2024-10-14 16:23:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:03,555 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 691 transitions. [2024-10-14 16:23:03,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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-14 16:23:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 691 transitions. [2024-10-14 16:23:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 16:23:03,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:03,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:23:03,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:23:03,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1080228512, now seen corresponding path program 1 times [2024-10-14 16:23:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:03,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782655281] [2024-10-14 16:23:03,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:03,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:03,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782655281] [2024-10-14 16:23:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782655281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:03,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:03,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:23:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062708086] [2024-10-14 16:23:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:03,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:23:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:23:03,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:23:03,793 INFO L87 Difference]: Start difference. First operand 514 states and 691 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-14 16:23:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:04,123 INFO L93 Difference]: Finished difference Result 1287 states and 1734 transitions. [2024-10-14 16:23:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:23:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 152 [2024-10-14 16:23:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:04,127 INFO L225 Difference]: With dead ends: 1287 [2024-10-14 16:23:04,127 INFO L226 Difference]: Without dead ends: 863 [2024-10-14 16:23:04,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:23:04,128 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1343 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:04,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1522 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:23:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-14 16:23:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 653. [2024-10-14 16:23:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 647 states have (on average 1.3508500772797527) internal successors, (874), 648 states have internal predecessors, (874), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 16:23:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 880 transitions. [2024-10-14 16:23:04,161 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 880 transitions. Word has length 152 [2024-10-14 16:23:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 880 transitions. [2024-10-14 16:23:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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-14 16:23:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 880 transitions. [2024-10-14 16:23:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 16:23:04,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:04,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:23:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:23:04,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:04,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1221442324, now seen corresponding path program 1 times [2024-10-14 16:23:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:04,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139398551] [2024-10-14 16:23:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:04,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139398551] [2024-10-14 16:23:04,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139398551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:23:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650438275] [2024-10-14 16:23:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:04,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:23:04,724 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-14 16:23:04,725 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-14 16:23:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:04,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 16:23:05,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:23:05,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:23:05,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 16:23:05,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 16:23:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:05,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:23:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650438275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:23:05,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:23:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-14 16:23:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881118537] [2024-10-14 16:23:05,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:23:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:23:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:23:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:23:05,351 INFO L87 Difference]: Start difference. First operand 653 states and 880 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:05,795 INFO L93 Difference]: Finished difference Result 2930 states and 3963 transitions. [2024-10-14 16:23:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 16:23:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 162 [2024-10-14 16:23:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:05,803 INFO L225 Difference]: With dead ends: 2930 [2024-10-14 16:23:05,803 INFO L226 Difference]: Without dead ends: 2523 [2024-10-14 16:23:05,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-14 16:23:05,805 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 2164 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 3418 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:05,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 3418 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:23:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-14 16:23:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 999. [2024-10-14 16:23:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 989 states have (on average 1.3447927199191103) internal successors, (1330), 990 states have internal predecessors, (1330), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 16:23:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1342 transitions. [2024-10-14 16:23:05,846 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1342 transitions. Word has length 162 [2024-10-14 16:23:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:05,846 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1342 transitions. [2024-10-14 16:23:05,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 11 states have internal predecessors, (324), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1342 transitions. [2024-10-14 16:23:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-14 16:23:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:05,851 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 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] [2024-10-14 16:23:05,867 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-14 16:23:06,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:06,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1696056037, now seen corresponding path program 1 times [2024-10-14 16:23:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670324215] [2024-10-14 16:23:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:09,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670324215] [2024-10-14 16:23:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670324215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:23:09,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010606539] [2024-10-14 16:23:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:09,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:09,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:23:09,099 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-14 16:23:09,103 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-14 16:23:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:09,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 16:23:09,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:23:09,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:23:09,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 16:23:09,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:10,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:10,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:10,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 16:23:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:10,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:23:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:10,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010606539] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:23:10,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:23:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2024-10-14 16:23:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143105207] [2024-10-14 16:23:10,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:23:10,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 16:23:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:10,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 16:23:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-10-14 16:23:10,654 INFO L87 Difference]: Start difference. First operand 999 states and 1342 transitions. Second operand has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:11,534 INFO L93 Difference]: Finished difference Result 6218 states and 8418 transitions. [2024-10-14 16:23:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 16:23:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2024-10-14 16:23:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:11,553 INFO L225 Difference]: With dead ends: 6218 [2024-10-14 16:23:11,554 INFO L226 Difference]: Without dead ends: 5811 [2024-10-14 16:23:11,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 774 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2024-10-14 16:23:11,560 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 5361 mSDsluCounter, 6206 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5381 SdHoareTripleChecker+Valid, 6628 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:11,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5381 Valid, 6628 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:23:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2024-10-14 16:23:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 1863. [2024-10-14 16:23:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1847 states have (on average 1.3405522468868436) internal successors, (2476), 1848 states have internal predecessors, (2476), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2500 transitions. [2024-10-14 16:23:11,647 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2500 transitions. Word has length 390 [2024-10-14 16:23:11,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:11,648 INFO L471 AbstractCegarLoop]: Abstraction has 1863 states and 2500 transitions. [2024-10-14 16:23:11,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.42857142857143) internal successors, (786), 20 states have internal predecessors, (786), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2500 transitions. [2024-10-14 16:23:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-14 16:23:11,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:11,662 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 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] [2024-10-14 16:23:11,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 16:23:11,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 16:23:11,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:11,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2047795881, now seen corresponding path program 2 times [2024-10-14 16:23:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273114801] [2024-10-14 16:23:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273114801] [2024-10-14 16:23:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273114801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:23:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117627126] [2024-10-14 16:23:22,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 16:23:22,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:22,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:23:22,470 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-14 16:23:22,471 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-14 16:23:23,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 16:23:23,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 16:23:23,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 16:23:23,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:23:23,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:23:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-14 16:23:23,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 16:23:23,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117627126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:23,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 16:23:23,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-10-14 16:23:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988196441] [2024-10-14 16:23:23,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:23:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:23:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 16:23:23,505 INFO L87 Difference]: Start difference. First operand 1863 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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-14 16:23:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:24,108 INFO L93 Difference]: Finished difference Result 2447 states and 3283 transitions. [2024-10-14 16:23:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:23:24,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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 846 [2024-10-14 16:23:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:24,115 INFO L225 Difference]: With dead ends: 2447 [2024-10-14 16:23:24,115 INFO L226 Difference]: Without dead ends: 2043 [2024-10-14 16:23:24,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 16:23:24,117 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 395 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:24,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2252 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:23:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2024-10-14 16:23:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1898. [2024-10-14 16:23:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1882 states have (on average 1.3363443145589797) internal successors, (2515), 1883 states have internal predecessors, (2515), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2539 transitions. [2024-10-14 16:23:24,160 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2539 transitions. Word has length 846 [2024-10-14 16:23:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:24,161 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2539 transitions. [2024-10-14 16:23:24,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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-14 16:23:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2539 transitions. [2024-10-14 16:23:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-14 16:23:24,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:24,177 INFO L215 NwaCegarLoop]: trace histogram [11, 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, 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] [2024-10-14 16:23:24,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 16:23:24,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:24,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2049895896, now seen corresponding path program 1 times [2024-10-14 16:23:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:24,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526526085] [2024-10-14 16:23:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:23:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:23:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526526085] [2024-10-14 16:23:34,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526526085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:23:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148700952] [2024-10-14 16:23:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:23:34,899 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-14 16:23:34,900 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-14 16:23:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:36,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 16:23:36,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 16:23:36,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 16:23:36,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 16:23:36,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:36,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:37,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-14 16:23:37,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 16:23:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:37,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 16:23:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:23:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148700952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 16:23:38,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 16:23:38,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 39 [2024-10-14 16:23:38,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382625898] [2024-10-14 16:23:38,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 16:23:38,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-14 16:23:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-14 16:23:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=910, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 16:23:38,067 INFO L87 Difference]: Start difference. First operand 1898 states and 2539 transitions. Second operand has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:39,890 INFO L93 Difference]: Finished difference Result 12829 states and 17366 transitions. [2024-10-14 16:23:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-14 16:23:39,891 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 847 [2024-10-14 16:23:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:39,930 INFO L225 Difference]: With dead ends: 12829 [2024-10-14 16:23:39,931 INFO L226 Difference]: Without dead ends: 12387 [2024-10-14 16:23:39,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1738 GetRequests, 1685 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=877, Invalid=1775, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 16:23:39,939 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 13701 mSDsluCounter, 11283 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13745 SdHoareTripleChecker+Valid, 11705 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:39,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13745 Valid, 11705 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 16:23:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2024-10-14 16:23:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 3626. [2024-10-14 16:23:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3598 states have (on average 1.3360200111172873) internal successors, (4807), 3599 states have internal predecessors, (4807), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 16:23:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4855 transitions. [2024-10-14 16:23:40,095 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4855 transitions. Word has length 847 [2024-10-14 16:23:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 4855 transitions. [2024-10-14 16:23:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 43.87179487179487) internal successors, (1711), 38 states have internal predecessors, (1711), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 16:23:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4855 transitions. [2024-10-14 16:23:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2024-10-14 16:23:40,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:40,112 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 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] [2024-10-14 16:23:40,136 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-14 16:23:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:23:40,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 16:23:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -747215732, now seen corresponding path program 2 times [2024-10-14 16:23:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894178793] [2024-10-14 16:23:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 16:24:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 16:24:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17561 backedges. 0 proven. 17558 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 16:24:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894178793] [2024-10-14 16:24:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894178793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 16:24:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047138936] [2024-10-14 16:24:23,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 16:24:23,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 16:24:23,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:24:23,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 16:24:23,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 16:24:25,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 16:24:25,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 16:24:25,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 16:24:25,102 INFO L278 TraceCheckSpWp]: Computing forward predicates...