./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 22:51:08,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 22:51:08,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 22:51:08,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 22:51:08,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 22:51:08,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 22:51:08,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 22:51:08,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 22:51:08,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 22:51:08,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 22:51:08,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 22:51:08,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 22:51:08,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 22:51:08,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 22:51:08,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 22:51:08,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 22:51:08,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 22:51:08,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 22:51:08,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 22:51:08,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 22:51:08,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 22:51:08,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 22:51:08,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 22:51:08,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 22:51:08,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 22:51:08,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 22:51:08,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 22:51:08,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 22:51:08,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 22:51:08,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 22:51:08,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 22:51:08,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 22:51:08,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:51:08,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 22:51:08,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 22:51:08,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 22:51:08,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 22:51:08,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 22:51:08,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 22:51:08,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 22:51:08,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 22:51:08,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 22:51:08,392 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-16 22:51:08,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 22:51:08,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 22:51:08,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 22:51:08,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 22:51:08,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 22:51:08,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 22:51:10,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 22:51:10,615 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 22:51:10,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 22:51:10,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34dd7c2ef/547510f6a8a841479b0f372f4ffb3f38/FLAG0391f24c3 [2024-11-16 22:51:10,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34dd7c2ef/547510f6a8a841479b0f372f4ffb3f38 [2024-11-16 22:51:10,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 22:51:10,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 22:51:10,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 22:51:10,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 22:51:10,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 22:51:10,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:51:10" (1/1) ... [2024-11-16 22:51:10,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4acd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:10, skipping insertion in model container [2024-11-16 22:51:10,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:51:10" (1/1) ... [2024-11-16 22:51:10,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 22:51:11,207 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-11-16 22:51:11,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-11-16 22:51:11,323 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-11-16 22:51:11,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:51:11,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 22:51:11,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[33021,33034] [2024-11-16 22:51:11,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44124,44137] [2024-11-16 22:51:11,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i[44245,44258] [2024-11-16 22:51:11,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 22:51:11,532 INFO L204 MainTranslator]: Completed translation [2024-11-16 22:51:11,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11 WrapperNode [2024-11-16 22:51:11,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 22:51:11,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 22:51:11,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 22:51:11,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 22:51:11,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,641 INFO L138 Inliner]: procedures = 176, calls = 269, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1388 [2024-11-16 22:51:11,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 22:51:11,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 22:51:11,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 22:51:11,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 22:51:11,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,743 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-16 22:51:11,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 22:51:11,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 22:51:11,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 22:51:11,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 22:51:11,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (1/1) ... [2024-11-16 22:51:11,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 22:51:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:11,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 22:51:11,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 22:51:11,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 22:51:11,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 22:51:11,924 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 22:51:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 22:51:11,925 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 22:51:11,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 22:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 22:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 22:51:11,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 22:51:11,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 22:51:12,176 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 22:51:12,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 22:51:13,538 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 22:51:13,657 INFO L? ?]: Removed 309 outVars from TransFormulas that were not future-live. [2024-11-16 22:51:13,657 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 22:51:13,730 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 22:51:13,732 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 22:51:13,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:51:13 BoogieIcfgContainer [2024-11-16 22:51:13,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 22:51:13,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 22:51:13,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 22:51:13,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 22:51:13,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:51:10" (1/3) ... [2024-11-16 22:51:13,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48571b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:51:13, skipping insertion in model container [2024-11-16 22:51:13,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:11" (2/3) ... [2024-11-16 22:51:13,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48571b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:51:13, skipping insertion in model container [2024-11-16 22:51:13,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:51:13" (3/3) ... [2024-11-16 22:51:13,744 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-11-16 22:51:13,763 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 22:51:13,763 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 22:51:13,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 22:51:13,847 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;@40c37925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 22:51:13,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 22:51:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 401 states, 394 states have (on average 1.616751269035533) internal successors, (637), 396 states have internal predecessors, (637), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 22:51:13,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:13,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:13,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash 288116022, now seen corresponding path program 1 times [2024-11-16 22:51:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:13,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717110370] [2024-11-16 22:51:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:51:14,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717110370] [2024-11-16 22:51:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717110370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 22:51:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668225521] [2024-11-16 22:51:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 22:51:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 22:51:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:51:14,121 INFO L87 Difference]: Start difference. First operand has 401 states, 394 states have (on average 1.616751269035533) internal successors, (637), 396 states have internal predecessors, (637), 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 4.5) internal successors, (9), 2 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-11-16 22:51:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:14,286 INFO L93 Difference]: Finished difference Result 799 states and 1283 transitions. [2024-11-16 22:51:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 22:51:14,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11-16 22:51:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:14,305 INFO L225 Difference]: With dead ends: 799 [2024-11-16 22:51:14,306 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 22:51:14,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 22:51:14,313 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:14,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 22:51:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 22:51:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 22:51:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.4435897435897436) internal successors, (563), 391 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 569 transitions. [2024-11-16 22:51:14,378 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 569 transitions. Word has length 9 [2024-11-16 22:51:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 569 transitions. [2024-11-16 22:51:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-11-16 22:51:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 569 transitions. [2024-11-16 22:51:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 22:51:14,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:14,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:14,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 22:51:14,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:14,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash 357719359, now seen corresponding path program 1 times [2024-11-16 22:51:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467128340] [2024-11-16 22:51:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:51:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:14,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467128340] [2024-11-16 22:51:14,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467128340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:14,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 22:51:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121593604] [2024-11-16 22:51:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 22:51:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 22:51:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 22:51:14,628 INFO L87 Difference]: Start difference. First operand 396 states and 569 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:14,967 INFO L93 Difference]: Finished difference Result 978 states and 1409 transitions. [2024-11-16 22:51:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 22:51:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-16 22:51:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:14,974 INFO L225 Difference]: With dead ends: 978 [2024-11-16 22:51:14,974 INFO L226 Difference]: Without dead ends: 785 [2024-11-16 22:51:14,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:51:14,977 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 553 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:14,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1518 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 22:51:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-16 22:51:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 398. [2024-11-16 22:51:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 392 states have (on average 1.441326530612245) internal successors, (565), 393 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 571 transitions. [2024-11-16 22:51:15,018 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 571 transitions. Word has length 11 [2024-11-16 22:51:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:15,020 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 571 transitions. [2024-11-16 22:51:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 571 transitions. [2024-11-16 22:51:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 22:51:15,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:15,024 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 22:51:15,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1188118530, now seen corresponding path program 1 times [2024-11-16 22:51:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:15,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353650152] [2024-11-16 22:51:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:51:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353650152] [2024-11-16 22:51:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353650152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:51:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597542668] [2024-11-16 22:51:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:51:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:51:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:51:15,580 INFO L87 Difference]: Start difference. First operand 398 states and 571 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:15,786 INFO L93 Difference]: Finished difference Result 750 states and 1072 transitions. [2024-11-16 22:51:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:51:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-16 22:51:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:15,789 INFO L225 Difference]: With dead ends: 750 [2024-11-16 22:51:15,789 INFO L226 Difference]: Without dead ends: 356 [2024-11-16 22:51:15,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:51:15,791 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 12 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:15,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1704 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:51:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-16 22:51:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-16 22:51:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 351 states have internal predecessors, (488), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 494 transitions. [2024-11-16 22:51:15,803 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 494 transitions. Word has length 88 [2024-11-16 22:51:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:15,803 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 494 transitions. [2024-11-16 22:51:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 494 transitions. [2024-11-16 22:51:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-16 22:51:15,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:15,806 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 22:51:15,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1586768132, now seen corresponding path program 1 times [2024-11-16 22:51:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354247226] [2024-11-16 22:51:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 22:51:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354247226] [2024-11-16 22:51:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354247226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 22:51:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028289238] [2024-11-16 22:51:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 22:51:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 22:51:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:51:15,992 INFO L87 Difference]: Start difference. First operand 356 states and 494 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:16,200 INFO L93 Difference]: Finished difference Result 961 states and 1347 transitions. [2024-11-16 22:51:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 22:51:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2024-11-16 22:51:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:16,205 INFO L225 Difference]: With dead ends: 961 [2024-11-16 22:51:16,206 INFO L226 Difference]: Without dead ends: 609 [2024-11-16 22:51:16,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 22:51:16,209 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 296 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:16,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1051 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 22:51:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-16 22:51:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2024-11-16 22:51:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 599 states have (on average 1.4123539232053421) internal successors, (846), 600 states have internal predecessors, (846), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 852 transitions. [2024-11-16 22:51:16,239 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 852 transitions. Word has length 88 [2024-11-16 22:51:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:16,240 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 852 transitions. [2024-11-16 22:51:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 22:51:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 852 transitions. [2024-11-16 22:51:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 22:51:16,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:16,244 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:16,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 22:51:16,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 833767152, now seen corresponding path program 1 times [2024-11-16 22:51:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618183940] [2024-11-16 22:51:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 22:51:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618183940] [2024-11-16 22:51:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618183940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:51:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949064614] [2024-11-16 22:51:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:16,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:51:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:51:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:51:16,752 INFO L87 Difference]: Start difference. First operand 605 states and 852 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:17,170 INFO L93 Difference]: Finished difference Result 894 states and 1263 transitions. [2024-11-16 22:51:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 22:51:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-16 22:51:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:17,177 INFO L225 Difference]: With dead ends: 894 [2024-11-16 22:51:17,177 INFO L226 Difference]: Without dead ends: 889 [2024-11-16 22:51:17,178 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-11-16 22:51:17,179 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 465 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:17,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1656 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 22:51:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-16 22:51:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 607. [2024-11-16 22:51:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 601 states have (on average 1.410981697171381) internal successors, (848), 602 states have internal predecessors, (848), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 854 transitions. [2024-11-16 22:51:17,217 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 854 transitions. Word has length 103 [2024-11-16 22:51:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 854 transitions. [2024-11-16 22:51:17,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 854 transitions. [2024-11-16 22:51:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:51:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:17,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 22:51:17,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 324882222, now seen corresponding path program 1 times [2024-11-16 22:51:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340132612] [2024-11-16 22:51:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 22:51:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:17,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340132612] [2024-11-16 22:51:17,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340132612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:17,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 22:51:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541223703] [2024-11-16 22:51:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:17,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 22:51:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 22:51:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 22:51:17,559 INFO L87 Difference]: Start difference. First operand 607 states and 854 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:17,952 INFO L93 Difference]: Finished difference Result 879 states and 1244 transitions. [2024-11-16 22:51:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:51:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 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 157 [2024-11-16 22:51:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:17,956 INFO L225 Difference]: With dead ends: 879 [2024-11-16 22:51:17,956 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 22:51:17,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:51:17,958 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 33 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:17,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 22:51:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 22:51:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2024-11-16 22:51:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 517 states have (on average 1.3423597678916828) internal successors, (694), 518 states have internal predecessors, (694), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 700 transitions. [2024-11-16 22:51:17,976 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 700 transitions. Word has length 157 [2024-11-16 22:51:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 700 transitions. [2024-11-16 22:51:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 700 transitions. [2024-11-16 22:51:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 22:51:17,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:17,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 22:51:17,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1200705159, now seen corresponding path program 1 times [2024-11-16 22:51:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718617163] [2024-11-16 22:51:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:18,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718617163] [2024-11-16 22:51:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718617163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:18,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 22:51:18,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 22:51:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569406780] [2024-11-16 22:51:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:18,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 22:51:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 22:51:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 22:51:18,332 INFO L87 Difference]: Start difference. First operand 523 states and 700 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:18,951 INFO L93 Difference]: Finished difference Result 1310 states and 1757 transitions. [2024-11-16 22:51:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 22:51:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 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 157 [2024-11-16 22:51:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:18,958 INFO L225 Difference]: With dead ends: 1310 [2024-11-16 22:51:18,958 INFO L226 Difference]: Without dead ends: 879 [2024-11-16 22:51:18,960 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-11-16 22:51:18,961 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1268 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:18,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 1503 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 22:51:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-16 22:51:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 664. [2024-11-16 22:51:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 658 states have (on average 1.344984802431611) internal successors, (885), 659 states have internal predecessors, (885), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 22:51:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 891 transitions. [2024-11-16 22:51:18,987 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 891 transitions. Word has length 157 [2024-11-16 22:51:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:18,988 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 891 transitions. [2024-11-16 22:51:18,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 891 transitions. [2024-11-16 22:51:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 22:51:18,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:18,991 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:18,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 22:51:18,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1223146812, now seen corresponding path program 1 times [2024-11-16 22:51:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184851132] [2024-11-16 22:51:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184851132] [2024-11-16 22:51:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184851132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:51:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664788795] [2024-11-16 22:51:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:19,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:51:19,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 22:51:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:20,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 22:51:20,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:51:20,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:51:20,448 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-11-16 22:51:20,460 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-11-16 22:51:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:20,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:51:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:20,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664788795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:51:20,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:51:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-16 22:51:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348356940] [2024-11-16 22:51:20,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:51:20,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 22:51:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:20,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 22:51:20,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-16 22:51:20,697 INFO L87 Difference]: Start difference. First operand 664 states and 891 transitions. Second operand has 12 states, 12 states have (on average 27.666666666666668) internal successors, (332), 11 states have internal predecessors, (332), 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-11-16 22:51:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:21,532 INFO L93 Difference]: Finished difference Result 2977 states and 4010 transitions. [2024-11-16 22:51:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 22:51:21,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.666666666666668) internal successors, (332), 11 states have internal predecessors, (332), 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 168 [2024-11-16 22:51:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:21,544 INFO L225 Difference]: With dead ends: 2977 [2024-11-16 22:51:21,545 INFO L226 Difference]: Without dead ends: 2564 [2024-11-16 22:51:21,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 333 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-11-16 22:51:21,547 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 1930 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:21,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 3263 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 22:51:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-16 22:51:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1016. [2024-11-16 22:51:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1006 states have (on average 1.3389662027833003) internal successors, (1347), 1007 states have internal predecessors, (1347), 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-11-16 22:51:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1359 transitions. [2024-11-16 22:51:21,603 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1359 transitions. Word has length 168 [2024-11-16 22:51:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:21,604 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1359 transitions. [2024-11-16 22:51:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.666666666666668) internal successors, (332), 11 states have internal predecessors, (332), 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-11-16 22:51:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1359 transitions. [2024-11-16 22:51:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-16 22:51:21,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:21,612 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, 4, 3, 3, 3, 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] [2024-11-16 22:51:21,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 22:51:21,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:21,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:21,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2032336513, now seen corresponding path program 1 times [2024-11-16 22:51:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561292536] [2024-11-16 22:51:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:25,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561292536] [2024-11-16 22:51:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561292536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:51:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196475520] [2024-11-16 22:51:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:25,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:25,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:25,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:51:25,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 22:51:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:26,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 22:51:26,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:51:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:51:27,024 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-11-16 22:51:27,156 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-11-16 22:51:27,290 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-11-16 22:51:27,422 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-11-16 22:51:27,430 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-11-16 22:51:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:27,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:51:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196475520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:51:28,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:51:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-16 22:51:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038672980] [2024-11-16 22:51:28,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:51:28,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 22:51:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 22:51:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2024-11-16 22:51:28,015 INFO L87 Difference]: Start difference. First operand 1016 states and 1359 transitions. Second operand has 21 states, 21 states have (on average 38.095238095238095) internal successors, (800), 20 states have internal predecessors, (800), 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-11-16 22:51:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:29,436 INFO L93 Difference]: Finished difference Result 6313 states and 8513 transitions. [2024-11-16 22:51:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 22:51:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 38.095238095238095) internal successors, (800), 20 states have internal predecessors, (800), 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 399 [2024-11-16 22:51:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:29,459 INFO L225 Difference]: With dead ends: 6313 [2024-11-16 22:51:29,459 INFO L226 Difference]: Without dead ends: 5900 [2024-11-16 22:51:29,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 794 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-11-16 22:51:29,464 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 5859 mSDsluCounter, 5240 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5879 SdHoareTripleChecker+Valid, 5645 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:29,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5879 Valid, 5645 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 22:51:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2024-11-16 22:51:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 1892. [2024-11-16 22:51:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1876 states have (on average 1.3352878464818763) internal successors, (2505), 1877 states have internal predecessors, (2505), 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-11-16 22:51:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2529 transitions. [2024-11-16 22:51:29,586 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2529 transitions. Word has length 399 [2024-11-16 22:51:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:29,587 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2529 transitions. [2024-11-16 22:51:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 38.095238095238095) internal successors, (800), 20 states have internal predecessors, (800), 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-11-16 22:51:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2529 transitions. [2024-11-16 22:51:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2024-11-16 22:51:29,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:29,608 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, 10, 9, 9, 9, 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] [2024-11-16 22:51:29,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 22:51:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 22:51:29,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash 819596833, now seen corresponding path program 2 times [2024-11-16 22:51:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:29,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621911324] [2024-11-16 22:51:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:41,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:41,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621911324] [2024-11-16 22:51:41,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621911324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:51:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241630272] [2024-11-16 22:51:41,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 22:51:41,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:41,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:41,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 22:51:41,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 22:51:41,974 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 22:51:41,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 22:51:41,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 22:51:41,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:51:42,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:51:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3471 trivial. 0 not checked. [2024-11-16 22:51:42,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 22:51:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241630272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 22:51:42,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 22:51:42,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-16 22:51:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208017641] [2024-11-16 22:51:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 22:51:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 22:51:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 22:51:42,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 22:51:42,710 INFO L87 Difference]: Start difference. First operand 1892 states and 2529 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:51:43,643 INFO L93 Difference]: Finished difference Result 2484 states and 3320 transitions. [2024-11-16 22:51:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 22:51:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 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 861 [2024-11-16 22:51:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:51:43,652 INFO L225 Difference]: With dead ends: 2484 [2024-11-16 22:51:43,652 INFO L226 Difference]: Without dead ends: 2074 [2024-11-16 22:51:43,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 22:51:43,655 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 401 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 22:51:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2188 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 22:51:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2024-11-16 22:51:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1928. [2024-11-16 22:51:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1912 states have (on average 1.3310669456066946) internal successors, (2545), 1913 states have internal predecessors, (2545), 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-11-16 22:51:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2569 transitions. [2024-11-16 22:51:43,718 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2569 transitions. Word has length 861 [2024-11-16 22:51:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:51:43,719 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2569 transitions. [2024-11-16 22:51:43,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 10 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 22:51:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2569 transitions. [2024-11-16 22:51:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2024-11-16 22:51:43,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:51:43,741 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, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:51:43,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 22:51:43,941 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-11-16 22:51:43,942 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:51:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:51:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1231691093, now seen corresponding path program 1 times [2024-11-16 22:51:43,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:51:43,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625069205] [2024-11-16 22:51:43,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:43,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:51:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:54,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 22:51:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 22:51:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 22:51:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625069205] [2024-11-16 22:51:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625069205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 22:51:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085914921] [2024-11-16 22:51:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:51:54,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 22:51:54,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 22:51:54,782 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-11-16 22:51:54,784 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-11-16 22:51:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 22:51:56,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 4171 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-16 22:51:56,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 22:51:56,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-16 22:51:56,347 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-11-16 22:51:56,457 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-11-16 22:51:56,561 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-11-16 22:51:56,664 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-11-16 22:51:56,753 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-11-16 22:51:56,837 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-11-16 22:51:56,929 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-11-16 22:51:57,024 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-11-16 22:51:57,127 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-11-16 22:51:57,225 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-11-16 22:51:57,229 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-11-16 22:51:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:57,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 22:51:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3471 backedges. 0 proven. 3467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 22:51:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085914921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 22:51:58,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 22:51:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 14] total 39 [2024-11-16 22:51:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351232434] [2024-11-16 22:51:58,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 22:51:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-16 22:51:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 22:51:58,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-16 22:51:58,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=910, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 22:51:58,303 INFO L87 Difference]: Start difference. First operand 1928 states and 2569 transitions. Second operand has 39 states, 39 states have (on average 44.53846153846154) internal successors, (1737), 38 states have internal predecessors, (1737), 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-11-16 22:52:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 22:52:00,893 INFO L93 Difference]: Finished difference Result 13021 states and 17558 transitions. [2024-11-16 22:52:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-16 22:52:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 44.53846153846154) internal successors, (1737), 38 states have internal predecessors, (1737), 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 862 [2024-11-16 22:52:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 22:52:00,943 INFO L225 Difference]: With dead ends: 13021 [2024-11-16 22:52:00,944 INFO L226 Difference]: Without dead ends: 12572 [2024-11-16 22:52:00,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1769 GetRequests, 1716 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-11-16 22:52:00,954 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 12653 mSDsluCounter, 10217 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12697 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 22:52:00,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12697 Valid, 10622 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 22:52:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2024-11-16 22:52:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 3680. [2024-11-16 22:52:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3652 states have (on average 1.3310514786418401) internal successors, (4861), 3653 states have internal predecessors, (4861), 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-11-16 22:52:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4909 transitions. [2024-11-16 22:52:01,157 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4909 transitions. Word has length 862 [2024-11-16 22:52:01,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 22:52:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 4909 transitions. [2024-11-16 22:52:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 44.53846153846154) internal successors, (1737), 38 states have internal predecessors, (1737), 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-11-16 22:52:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4909 transitions. [2024-11-16 22:52:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1787 [2024-11-16 22:52:01,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 22:52:01,189 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, 22, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 22:52:01,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 22:52:01,390 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-11-16 22:52:01,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 22:52:01,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 22:52:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1455240043, now seen corresponding path program 2 times [2024-11-16 22:52:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 22:52:01,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101728054] [2024-11-16 22:52:01,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 22:52:01,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 22:52:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat