./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-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 f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:23:27,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:23:27,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 05:23:27,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:23:27,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:23:27,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:23:27,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:23:27,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:23:27,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 05:23:27,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 05:23:27,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:23:27,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:23:27,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:23:27,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:23:27,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:23:27,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:23:27,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:23:27,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:23:27,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:23:27,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:23:27,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:23:27,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:23:27,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:23:27,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:23:27,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:23:27,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:23:27,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:23:27,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:23:27,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:23:27,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:23:27,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:23:27,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:23:27,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:23:27,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:23:27,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:23:27,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:23:27,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:23:27,843 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 -> f6bf6d70eb07e52125f91259e05d2dabd63dc1b16a64b1f25a229511f6ff83f8 [2024-11-19 05:23:28,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:23:28,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:23:28,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:23:28,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:23:28,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:23:28,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2024-11-19 05:23:29,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:23:29,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:23:29,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-1.i [2024-11-19 05:23:29,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fbf9f98/e2fd8c64c4a94aee9353393612cd96f4/FLAG4aca1bb56 [2024-11-19 05:23:29,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65fbf9f98/e2fd8c64c4a94aee9353393612cd96f4 [2024-11-19 05:23:29,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:23:29,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:23:29,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:23:29,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:23:29,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:23:29,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:29" (1/1) ... [2024-11-19 05:23:29,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd9c853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:29, skipping insertion in model container [2024-11-19 05:23:29,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:29" (1/1) ... [2024-11-19 05:23:29,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:23:30,227 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_SFH_test3-1.i[33021,33034] [2024-11-19 05:23:30,311 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_SFH_test3-1.i[44590,44603] [2024-11-19 05:23:30,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:23:30,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:23:30,365 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_SFH_test3-1.i[33021,33034] [2024-11-19 05:23:30,414 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_SFH_test3-1.i[44590,44603] [2024-11-19 05:23:30,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:23:30,451 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:23:30,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30 WrapperNode [2024-11-19 05:23:30,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:23:30,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:23:30,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:23:30,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:23:30,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,541 INFO L138 Inliner]: procedures = 177, calls = 277, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1455 [2024-11-19 05:23:30,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:23:30,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:23:30,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:23:30,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:23:30,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,608 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 34]. 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, 50, 4]. [2024-11-19 05:23:30,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:23:30,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:23:30,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:23:30,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:23:30,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (1/1) ... [2024-11-19 05:23:30,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:23:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:23:30,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:23:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:23:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 05:23:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 05:23:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 05:23:30,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 05:23:30,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 05:23:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 05:23:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 05:23:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 05:23:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 05:23:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:23:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:23:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 05:23:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 05:23:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 05:23:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:23:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 05:23:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 05:23:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 05:23:30,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:23:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 05:23:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 05:23:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 05:23:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:23:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:23:30,981 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:23:30,983 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:23:32,267 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-19 05:23:32,267 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:23:32,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:23:32,288 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 05:23:32,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:32 BoogieIcfgContainer [2024-11-19 05:23:32,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:23:32,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:23:32,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:23:32,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:23:32,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:23:29" (1/3) ... [2024-11-19 05:23:32,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba60cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:32, skipping insertion in model container [2024-11-19 05:23:32,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:30" (2/3) ... [2024-11-19 05:23:32,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba60cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:32, skipping insertion in model container [2024-11-19 05:23:32,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:32" (3/3) ... [2024-11-19 05:23:32,295 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-1.i [2024-11-19 05:23:32,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:23:32,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 05:23:32,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:23:32,377 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;@c3023c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:23:32,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 05:23:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 412 states, 399 states have (on average 1.6240601503759398) internal successors, (648), 406 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 05:23:32,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:32,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:32,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:32,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1749667479, now seen corresponding path program 1 times [2024-11-19 05:23:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902386767] [2024-11-19 05:23:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:23:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902386767] [2024-11-19 05:23:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902386767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:32,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:23:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818979255] [2024-11-19 05:23:32,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:32,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:23:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:23:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:23:32,715 INFO L87 Difference]: Start difference. First operand has 412 states, 399 states have (on average 1.6240601503759398) internal successors, (648), 406 states have internal predecessors, (648), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) 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-19 05:23:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:32,780 INFO L93 Difference]: Finished difference Result 822 states and 1331 transitions. [2024-11-19 05:23:32,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:23:32,782 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-19 05:23:32,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:32,792 INFO L225 Difference]: With dead ends: 822 [2024-11-19 05:23:32,793 INFO L226 Difference]: Without dead ends: 408 [2024-11-19 05:23:32,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:23:32,799 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:32,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:23:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-19 05:23:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2024-11-19 05:23:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 396 states have (on average 1.452020202020202) internal successors, (575), 402 states have internal predecessors, (575), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 591 transitions. [2024-11-19 05:23:32,859 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 591 transitions. Word has length 9 [2024-11-19 05:23:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 591 transitions. [2024-11-19 05:23:32,860 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-19 05:23:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 591 transitions. [2024-11-19 05:23:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 05:23:32,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:32,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:23:32,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:32,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1635991573, now seen corresponding path program 1 times [2024-11-19 05:23:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547963331] [2024-11-19 05:23:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:32,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:23:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547963331] [2024-11-19 05:23:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547963331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:33,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:33,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:33,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418931203] [2024-11-19 05:23:33,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:33,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:33,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:33,056 INFO L87 Difference]: Start difference. First operand 408 states and 591 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:33,201 INFO L93 Difference]: Finished difference Result 1010 states and 1472 transitions. [2024-11-19 05:23:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:23:33,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 05:23:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:33,206 INFO L225 Difference]: With dead ends: 1010 [2024-11-19 05:23:33,206 INFO L226 Difference]: Without dead ends: 803 [2024-11-19 05:23:33,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:33,209 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 560 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:33,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1709 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-11-19 05:23:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 410. [2024-11-19 05:23:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.449748743718593) internal successors, (577), 404 states have internal predecessors, (577), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2024-11-19 05:23:33,233 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 14 [2024-11-19 05:23:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2024-11-19 05:23:33,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2024-11-19 05:23:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 05:23:33,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:33,236 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:33,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:23:33,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:33,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash 714752182, now seen corresponding path program 1 times [2024-11-19 05:23:33,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:33,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422896853] [2024-11-19 05:23:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:33,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-19 05:23:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422896853] [2024-11-19 05:23:33,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422896853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56261521] [2024-11-19 05:23:33,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:33,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:33,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:33,609 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:33,761 INFO L93 Difference]: Finished difference Result 774 states and 1116 transitions. [2024-11-19 05:23:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:23:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-19 05:23:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:33,768 INFO L225 Difference]: With dead ends: 774 [2024-11-19 05:23:33,768 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 05:23:33,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:33,771 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 30 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:33,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1448 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 05:23:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-19 05:23:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.404494382022472) internal successors, (500), 362 states have internal predecessors, (500), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 516 transitions. [2024-11-19 05:23:33,807 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 516 transitions. Word has length 90 [2024-11-19 05:23:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 516 transitions. [2024-11-19 05:23:33,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 516 transitions. [2024-11-19 05:23:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 05:23:33,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:33,817 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:33,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:23:33,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash -654857406, now seen corresponding path program 1 times [2024-11-19 05:23:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362834112] [2024-11-19 05:23:33,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:34,127 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-19 05:23:34,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:34,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362834112] [2024-11-19 05:23:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362834112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:34,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:23:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725715471] [2024-11-19 05:23:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:23:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:23:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:23:34,134 INFO L87 Difference]: Start difference. First operand 368 states and 516 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:34,309 INFO L93 Difference]: Finished difference Result 983 states and 1389 transitions. [2024-11-19 05:23:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:23:34,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-19 05:23:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:34,313 INFO L225 Difference]: With dead ends: 983 [2024-11-19 05:23:34,313 INFO L226 Difference]: Without dead ends: 619 [2024-11-19 05:23:34,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:23:34,321 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 295 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:34,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1178 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-19 05:23:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-19 05:23:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 603 states have (on average 1.4195688225538972) internal successors, (856), 609 states have internal predecessors, (856), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 872 transitions. [2024-11-19 05:23:34,362 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 872 transitions. Word has length 90 [2024-11-19 05:23:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:34,366 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 872 transitions. [2024-11-19 05:23:34,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:23:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 872 transitions. [2024-11-19 05:23:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 05:23:34,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:34,371 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] [2024-11-19 05:23:34,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:23:34,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash 581917402, now seen corresponding path program 1 times [2024-11-19 05:23:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163474996] [2024-11-19 05:23:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:34,712 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-19 05:23:34,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:34,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163474996] [2024-11-19 05:23:34,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163474996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:34,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:34,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193821395] [2024-11-19 05:23:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:34,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:34,716 INFO L87 Difference]: Start difference. First operand 615 states and 872 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:34,939 INFO L93 Difference]: Finished difference Result 914 states and 1297 transitions. [2024-11-19 05:23:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:23:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-11-19 05:23:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:34,946 INFO L225 Difference]: With dead ends: 914 [2024-11-19 05:23:34,946 INFO L226 Difference]: Without dead ends: 893 [2024-11-19 05:23:34,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:34,948 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 458 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:34,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1461 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-19 05:23:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 617. [2024-11-19 05:23:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 605 states have (on average 1.4181818181818182) internal successors, (858), 611 states have internal predecessors, (858), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 874 transitions. [2024-11-19 05:23:34,964 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 874 transitions. Word has length 105 [2024-11-19 05:23:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:34,965 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 874 transitions. [2024-11-19 05:23:34,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 874 transitions. [2024-11-19 05:23:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:23:34,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:34,971 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] [2024-11-19 05:23:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:23:34,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash 957710152, now seen corresponding path program 1 times [2024-11-19 05:23:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635006721] [2024-11-19 05:23:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:35,249 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-19 05:23:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:35,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635006721] [2024-11-19 05:23:35,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635006721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:35,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:35,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:23:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874889974] [2024-11-19 05:23:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:35,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:23:35,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:35,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:23:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:23:35,252 INFO L87 Difference]: Start difference. First operand 617 states and 874 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:35,319 INFO L93 Difference]: Finished difference Result 899 states and 1281 transitions. [2024-11-19 05:23:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:23:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 155 [2024-11-19 05:23:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:35,322 INFO L225 Difference]: With dead ends: 899 [2024-11-19 05:23:35,323 INFO L226 Difference]: Without dead ends: 533 [2024-11-19 05:23:35,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:35,324 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 30 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:35,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1199 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 05:23:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-19 05:23:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-19 05:23:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 521 states have (on average 1.3512476007677543) internal successors, (704), 527 states have internal predecessors, (704), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 720 transitions. [2024-11-19 05:23:35,335 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 720 transitions. Word has length 155 [2024-11-19 05:23:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:35,336 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 720 transitions. [2024-11-19 05:23:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 720 transitions. [2024-11-19 05:23:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-19 05:23:35,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:35,337 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] [2024-11-19 05:23:35,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:23:35,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:35,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash -213803972, now seen corresponding path program 1 times [2024-11-19 05:23:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279639965] [2024-11-19 05:23:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:35,559 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-19 05:23:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:35,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279639965] [2024-11-19 05:23:35,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279639965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:35,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:35,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:23:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973473527] [2024-11-19 05:23:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:35,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:23:35,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:23:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:23:35,561 INFO L87 Difference]: Start difference. First operand 533 states and 720 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:36,074 INFO L93 Difference]: Finished difference Result 1333 states and 1807 transitions. [2024-11-19 05:23:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:23:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 155 [2024-11-19 05:23:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:36,086 INFO L225 Difference]: With dead ends: 1333 [2024-11-19 05:23:36,087 INFO L226 Difference]: Without dead ends: 891 [2024-11-19 05:23:36,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:23:36,088 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 921 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:36,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1532 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 05:23:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-19 05:23:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 672. [2024-11-19 05:23:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.353030303030303) internal successors, (893), 666 states have internal predecessors, (893), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 05:23:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 909 transitions. [2024-11-19 05:23:36,134 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 909 transitions. Word has length 155 [2024-11-19 05:23:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 909 transitions. [2024-11-19 05:23:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 909 transitions. [2024-11-19 05:23:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-19 05:23:36,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:36,136 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] [2024-11-19 05:23:36,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:23:36,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 884502256, now seen corresponding path program 1 times [2024-11-19 05:23:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683022497] [2024-11-19 05:23:36,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:36,859 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-19 05:23:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683022497] [2024-11-19 05:23:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683022497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:23:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102012827] [2024-11-19 05:23:36,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:36,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:23:36,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:23:36,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:23:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:23:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:37,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 05:23:37,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:23:37,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:23:37,415 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-19 05:23:37,421 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-19 05:23:37,428 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-19 05:23:37,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:23:37,584 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-19 05:23:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102012827] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:23:37,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:23:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2024-11-19 05:23:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866095818] [2024-11-19 05:23:37,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:23:37,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 05:23:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 05:23:37,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 05:23:37,587 INFO L87 Difference]: Start difference. First operand 672 states and 909 transitions. Second operand has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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-19 05:23:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:37,828 INFO L93 Difference]: Finished difference Result 2166 states and 2935 transitions. [2024-11-19 05:23:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:23:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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 165 [2024-11-19 05:23:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:37,834 INFO L225 Difference]: With dead ends: 2166 [2024-11-19 05:23:37,835 INFO L226 Difference]: Without dead ends: 1742 [2024-11-19 05:23:37,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 05:23:37,836 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1908 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1917 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:37,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1917 Valid, 2930 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 05:23:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-11-19 05:23:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1019. [2024-11-19 05:23:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1003 states have (on average 1.345962113659023) internal successors, (1350), 1009 states have internal predecessors, (1350), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 05:23:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2024-11-19 05:23:37,870 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 165 [2024-11-19 05:23:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2024-11-19 05:23:37,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.636363636363637) internal successors, (326), 11 states have internal predecessors, (326), 3 states have call successors, (6), 2 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-19 05:23:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2024-11-19 05:23:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-19 05:23:37,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:37,874 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:37,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:23:38,075 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-19 05:23:38,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash 924357367, now seen corresponding path program 1 times [2024-11-19 05:23:38,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:38,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203608221] [2024-11-19 05:23:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:23:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203608221] [2024-11-19 05:23:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203608221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:23:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210654532] [2024-11-19 05:23:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:41,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:23:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:23:41,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:23:41,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:23:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:41,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:23:41,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:23:41,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 05:23:41,788 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-19 05:23:41,881 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-19 05:23:41,973 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-19 05:23:42,065 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-19 05:23:42,071 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-19 05:23:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:23:42,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:23:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 05:23:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210654532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:23:42,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:23:42,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 19 [2024-11-19 05:23:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345825038] [2024-11-19 05:23:42,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:23:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 05:23:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 05:23:42,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2024-11-19 05:23:42,529 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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-19 05:23:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:43,005 INFO L93 Difference]: Finished difference Result 4275 states and 5806 transitions. [2024-11-19 05:23:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 05:23:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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 393 [2024-11-19 05:23:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:43,018 INFO L225 Difference]: With dead ends: 4275 [2024-11-19 05:23:43,019 INFO L226 Difference]: Without dead ends: 3851 [2024-11-19 05:23:43,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 778 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2024-11-19 05:23:43,022 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 5114 mSDsluCounter, 4246 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5144 SdHoareTripleChecker+Valid, 4706 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:43,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5144 Valid, 4706 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2024-11-19 05:23:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 1883. [2024-11-19 05:23:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1861 states have (on average 1.3412144008597529) internal successors, (2496), 1867 states have internal predecessors, (2496), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:23:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2530 transitions. [2024-11-19 05:23:43,129 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2530 transitions. Word has length 393 [2024-11-19 05:23:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:43,129 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2530 transitions. [2024-11-19 05:23:43,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 41.36842105263158) internal successors, (786), 19 states have internal predecessors, (786), 3 states have call successors, (6), 2 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-19 05:23:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2530 transitions. [2024-11-19 05:23:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-19 05:23:43,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:43,141 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:43,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 05:23:43,342 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-19 05:23:43,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1061192571, now seen corresponding path program 2 times [2024-11-19 05:23:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247168781] [2024-11-19 05:23:43,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:23:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:43,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:23:43,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:23:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:23:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247168781] [2024-11-19 05:23:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247168781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:43,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:23:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132736310] [2024-11-19 05:23:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:23:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:23:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:43,850 INFO L87 Difference]: Start difference. First operand 1883 states and 2530 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:44,151 INFO L93 Difference]: Finished difference Result 2337 states and 3147 transitions. [2024-11-19 05:23:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:23:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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 849 [2024-11-19 05:23:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:44,160 INFO L225 Difference]: With dead ends: 2337 [2024-11-19 05:23:44,160 INFO L226 Difference]: Without dead ends: 1916 [2024-11-19 05:23:44,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:23:44,162 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 21 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:44,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1778 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-19 05:23:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1895. [2024-11-19 05:23:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1873 states have (on average 1.3390282968499734) internal successors, (2508), 1879 states have internal predecessors, (2508), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:23:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2542 transitions. [2024-11-19 05:23:44,216 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2542 transitions. Word has length 849 [2024-11-19 05:23:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2542 transitions. [2024-11-19 05:23:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2542 transitions. [2024-11-19 05:23:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2024-11-19 05:23:44,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:44,232 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 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-19 05:23:44,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:23:44,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:44,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1981437128, now seen corresponding path program 1 times [2024-11-19 05:23:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688690169] [2024-11-19 05:23:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:23:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688690169] [2024-11-19 05:23:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688690169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:46,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:23:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173987814] [2024-11-19 05:23:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:23:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:46,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:23:46,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:23:46,683 INFO L87 Difference]: Start difference. First operand 1895 states and 2542 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:47,019 INFO L93 Difference]: Finished difference Result 2373 states and 3189 transitions. [2024-11-19 05:23:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:23:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 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 850 [2024-11-19 05:23:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:47,027 INFO L225 Difference]: With dead ends: 2373 [2024-11-19 05:23:47,027 INFO L226 Difference]: Without dead ends: 1940 [2024-11-19 05:23:47,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:23:47,029 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 24 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:47,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2449 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-19 05:23:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1907. [2024-11-19 05:23:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1885 states have (on average 1.3384615384615384) internal successors, (2523), 1891 states have internal predecessors, (2523), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:23:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2557 transitions. [2024-11-19 05:23:47,087 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2557 transitions. Word has length 850 [2024-11-19 05:23:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:47,088 INFO L471 AbstractCegarLoop]: Abstraction has 1907 states and 2557 transitions. [2024-11-19 05:23:47,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 8 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2557 transitions. [2024-11-19 05:23:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:23:47,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:47,095 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 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-19 05:23:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:23:47,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 786838865, now seen corresponding path program 1 times [2024-11-19 05:23:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701746925] [2024-11-19 05:23:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:23:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:49,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701746925] [2024-11-19 05:23:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701746925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:49,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:49,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 05:23:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621061458] [2024-11-19 05:23:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:49,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 05:23:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 05:23:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 05:23:49,771 INFO L87 Difference]: Start difference. First operand 1907 states and 2557 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:50,194 INFO L93 Difference]: Finished difference Result 2385 states and 3210 transitions. [2024-11-19 05:23:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:23:50,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:23:50,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:50,203 INFO L225 Difference]: With dead ends: 2385 [2024-11-19 05:23:50,203 INFO L226 Difference]: Without dead ends: 1940 [2024-11-19 05:23:50,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 05:23:50,205 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 32 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:50,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2875 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 05:23:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-19 05:23:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1931. [2024-11-19 05:23:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1909 states have (on average 1.3373493975903614) internal successors, (2553), 1915 states have internal predecessors, (2553), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:23:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2587 transitions. [2024-11-19 05:23:50,253 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2587 transitions. Word has length 851 [2024-11-19 05:23:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:50,254 INFO L471 AbstractCegarLoop]: Abstraction has 1931 states and 2587 transitions. [2024-11-19 05:23:50,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2587 transitions. [2024-11-19 05:23:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-19 05:23:50,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:50,261 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 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-19 05:23:50,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:23:50,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1011562922, now seen corresponding path program 1 times [2024-11-19 05:23:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329054136] [2024-11-19 05:23:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:23:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:23:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-19 05:23:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:23:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329054136] [2024-11-19 05:23:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329054136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:23:52,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:23:52,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:23:52,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817246788] [2024-11-19 05:23:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:23:52,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:23:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:23:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:23:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:52,451 INFO L87 Difference]: Start difference. First operand 1931 states and 2587 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 05:23:52,702 INFO L93 Difference]: Finished difference Result 2427 states and 3252 transitions. [2024-11-19 05:23:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 05:23:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-19 05:23:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 05:23:52,709 INFO L225 Difference]: With dead ends: 2427 [2024-11-19 05:23:52,710 INFO L226 Difference]: Without dead ends: 1958 [2024-11-19 05:23:52,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:23:52,712 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 16 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 05:23:52,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1798 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 05:23:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-19 05:23:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1940. [2024-11-19 05:23:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1918 states have (on average 1.3357664233576643) internal successors, (2562), 1924 states have internal predecessors, (2562), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 05:23:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2596 transitions. [2024-11-19 05:23:52,766 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2596 transitions. Word has length 851 [2024-11-19 05:23:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 05:23:52,768 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2596 transitions. [2024-11-19 05:23:52,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 05:23:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2596 transitions. [2024-11-19 05:23:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-19 05:23:52,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 05:23:52,776 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:23:52,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:23:52,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 05:23:52,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:23:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2118759429, now seen corresponding path program 1 times [2024-11-19 05:23:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:23:52,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973816078] [2024-11-19 05:23:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:23:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms