./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya --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 afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:26:13,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:26:13,965 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:26:13,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:26:13,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:26:13,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:26:13,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:26:13,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:26:13,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:26:13,995 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:26:13,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:26:13,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:26:13,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:26:13,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:26:13,998 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:26:13,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:26:13,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:26:13,999 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:26:14,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:26:14,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:26:14,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:26:14,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:26:14,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:26:14,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:26:14,003 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:26:14,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:26:14,003 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:26:14,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:26:14,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:26:14,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:26:14,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:26:14,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:26:14,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:26:14,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:26:14,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:26:14,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:26:14,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:26:14,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:26:14,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:26:14,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:26:14,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:26:14,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:26:14,009 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya 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 -> afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df [2023-11-29 00:26:14,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:26:14,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:26:14,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:26:14,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:26:14,227 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:26:14,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2023-11-29 00:26:17,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:26:17,207 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:26:17,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2023-11-29 00:26:17,217 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/data/8ab8d8a47/ceb3ad6b41a8471d8c92e82c83a7c477/FLAGffce8548d [2023-11-29 00:26:17,231 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/data/8ab8d8a47/ceb3ad6b41a8471d8c92e82c83a7c477 [2023-11-29 00:26:17,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:26:17,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:26:17,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:26:17,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:26:17,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:26:17,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f133bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17, skipping insertion in model container [2023-11-29 00:26:17,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,273 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:26:17,408 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2023-11-29 00:26:17,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:26:17,489 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:26:17,502 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2023-11-29 00:26:17,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:26:17,560 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:26:17,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17 WrapperNode [2023-11-29 00:26:17,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:26:17,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:26:17,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:26:17,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:26:17,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,635 INFO L138 Inliner]: procedures = 26, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2023-11-29 00:26:17,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:26:17,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:26:17,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:26:17,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:26:17,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,694 INFO L175 MemorySlicer]: Split 138 memory accesses to 6 slices as follows [2, 20, 16, 85, 7, 8]. 62 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 1, 2]. The 18 writes are split as follows [0, 3, 3, 8, 1, 3]. [2023-11-29 00:26:17,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:26:17,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:26:17,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:26:17,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:26:17,743 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (1/1) ... [2023-11-29 00:26:17,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:26:17,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:17,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:26:17,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:26:17,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:26:17,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:26:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:26:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:26:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:26:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:26:17,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:26:17,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 00:26:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:26:17,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:26:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:26:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:26:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:26:17,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:26:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:26:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 00:26:17,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:26:17,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:26:17,947 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:26:17,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:26:18,392 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:26:18,423 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:26:18,423 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:26:18,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:26:18 BoogieIcfgContainer [2023-11-29 00:26:18,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:26:18,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:26:18,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:26:18,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:26:18,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:26:17" (1/3) ... [2023-11-29 00:26:18,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53846e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:26:18, skipping insertion in model container [2023-11-29 00:26:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:26:17" (2/3) ... [2023-11-29 00:26:18,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53846e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:26:18, skipping insertion in model container [2023-11-29 00:26:18,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:26:18" (3/3) ... [2023-11-29 00:26:18,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-71.i [2023-11-29 00:26:18,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:26:18,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:26:18,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:26:18,501 INFO L357 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, mHoare=true, 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;@30b57484, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:26:18,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:26:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:26:18,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:18,519 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:18,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:18,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2045531038, now seen corresponding path program 1 times [2023-11-29 00:26:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997539129] [2023-11-29 00:26:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997539129] [2023-11-29 00:26:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997539129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:18,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:18,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:26:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508535118] [2023-11-29 00:26:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:18,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:26:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:26:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:26:18,901 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:18,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:18,974 INFO L93 Difference]: Finished difference Result 193 states and 309 transitions. [2023-11-29 00:26:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:26:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2023-11-29 00:26:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:18,984 INFO L225 Difference]: With dead ends: 193 [2023-11-29 00:26:18,984 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 00:26:18,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:26:18,991 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:18,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:26:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 00:26:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-29 00:26:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2023-11-29 00:26:19,037 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 139 [2023-11-29 00:26:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:19,038 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2023-11-29 00:26:19,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2023-11-29 00:26:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:26:19,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:19,043 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:19,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:26:19,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:19,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -433866812, now seen corresponding path program 1 times [2023-11-29 00:26:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558897888] [2023-11-29 00:26:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:19,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:19,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558897888] [2023-11-29 00:26:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558897888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:26:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073616944] [2023-11-29 00:26:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:19,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:26:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:26:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:26:19,355 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:19,420 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-11-29 00:26:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:26:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-29 00:26:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:19,424 INFO L225 Difference]: With dead ends: 199 [2023-11-29 00:26:19,424 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 00:26:19,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:19,427 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:19,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 393 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:26:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 00:26:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-29 00:26:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2023-11-29 00:26:19,443 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 139 [2023-11-29 00:26:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:19,445 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2023-11-29 00:26:19,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2023-11-29 00:26:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:26:19,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:19,449 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:19,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:26:19,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:19,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash -376608510, now seen corresponding path program 1 times [2023-11-29 00:26:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187776318] [2023-11-29 00:26:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187776318] [2023-11-29 00:26:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187776318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:19,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:26:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627721554] [2023-11-29 00:26:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:19,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:26:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:26:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:26:19,703 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:19,750 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-11-29 00:26:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:26:19,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-29 00:26:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:19,754 INFO L225 Difference]: With dead ends: 199 [2023-11-29 00:26:19,754 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 00:26:19,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:19,757 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:19,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 394 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:26:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 00:26:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-11-29 00:26:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-11-29 00:26:19,771 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 139 [2023-11-29 00:26:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:19,772 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-11-29 00:26:19,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-11-29 00:26:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:26:19,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:19,776 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:19,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:26:19,777 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:19,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -376548928, now seen corresponding path program 1 times [2023-11-29 00:26:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:19,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826435258] [2023-11-29 00:26:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:20,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:20,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826435258] [2023-11-29 00:26:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826435258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:26:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291071308] [2023-11-29 00:26:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:20,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:26:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:20,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:26:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:20,192 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:20,301 INFO L93 Difference]: Finished difference Result 247 states and 352 transitions. [2023-11-29 00:26:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:26:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2023-11-29 00:26:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:20,304 INFO L225 Difference]: With dead ends: 247 [2023-11-29 00:26:20,304 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:26:20,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:20,306 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 91 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:20,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 627 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:26:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2023-11-29 00:26:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2023-11-29 00:26:20,319 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 139 [2023-11-29 00:26:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:20,320 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2023-11-29 00:26:20,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2023-11-29 00:26:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-29 00:26:20,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:20,323 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:26:20,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1259755813, now seen corresponding path program 1 times [2023-11-29 00:26:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982828005] [2023-11-29 00:26:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:20,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:20,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982828005] [2023-11-29 00:26:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982828005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:26:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334729502] [2023-11-29 00:26:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:20,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:26:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:26:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:20,962 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:21,158 INFO L93 Difference]: Finished difference Result 297 states and 419 transitions. [2023-11-29 00:26:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:26:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2023-11-29 00:26:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:21,161 INFO L225 Difference]: With dead ends: 297 [2023-11-29 00:26:21,161 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 00:26:21,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:21,163 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 149 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:21,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 803 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 00:26:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 114. [2023-11-29 00:26:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 00:26:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2023-11-29 00:26:21,175 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 140 [2023-11-29 00:26:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:21,176 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2023-11-29 00:26:21,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2023-11-29 00:26:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-29 00:26:21,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:21,178 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:26:21,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:21,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash 881140615, now seen corresponding path program 1 times [2023-11-29 00:26:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:21,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783162996] [2023-11-29 00:26:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783162996] [2023-11-29 00:26:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783162996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:22,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:22,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:26:22,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091523124] [2023-11-29 00:26:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:22,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:26:22,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:26:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:26:22,672 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:24,270 INFO L93 Difference]: Finished difference Result 422 states and 594 transitions. [2023-11-29 00:26:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:26:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 141 [2023-11-29 00:26:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:24,274 INFO L225 Difference]: With dead ends: 422 [2023-11-29 00:26:24,274 INFO L226 Difference]: Without dead ends: 309 [2023-11-29 00:26:24,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:26:24,276 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 317 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:24,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1557 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:26:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-11-29 00:26:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 191. [2023-11-29 00:26:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 157 states have internal predecessors, (207), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 00:26:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 271 transitions. [2023-11-29 00:26:24,305 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 271 transitions. Word has length 141 [2023-11-29 00:26:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:24,306 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 271 transitions. [2023-11-29 00:26:24,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 271 transitions. [2023-11-29 00:26:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-29 00:26:24,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:24,308 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:24,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:26:24,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:24,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 563668448, now seen corresponding path program 1 times [2023-11-29 00:26:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519551191] [2023-11-29 00:26:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519551191] [2023-11-29 00:26:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519551191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:24,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:26:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342331223] [2023-11-29 00:26:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:24,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:26:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:26:24,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:26:24,698 INFO L87 Difference]: Start difference. First operand 191 states and 271 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:24,829 INFO L93 Difference]: Finished difference Result 444 states and 620 transitions. [2023-11-29 00:26:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:26:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2023-11-29 00:26:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:24,833 INFO L225 Difference]: With dead ends: 444 [2023-11-29 00:26:24,833 INFO L226 Difference]: Without dead ends: 254 [2023-11-29 00:26:24,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:24,835 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 111 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:24,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-11-29 00:26:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 229. [2023-11-29 00:26:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 188 states have (on average 1.297872340425532) internal successors, (244), 190 states have internal predecessors, (244), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:26:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 316 transitions. [2023-11-29 00:26:24,859 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 316 transitions. Word has length 141 [2023-11-29 00:26:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:24,860 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 316 transitions. [2023-11-29 00:26:24,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 316 transitions. [2023-11-29 00:26:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 00:26:24,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:24,862 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:24,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:26:24,862 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:24,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1149418449, now seen corresponding path program 1 times [2023-11-29 00:26:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609598080] [2023-11-29 00:26:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:25,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609598080] [2023-11-29 00:26:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609598080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:26:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982633511] [2023-11-29 00:26:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:25,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:26:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:26:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:26:25,194 INFO L87 Difference]: Start difference. First operand 229 states and 316 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:25,367 INFO L93 Difference]: Finished difference Result 458 states and 627 transitions. [2023-11-29 00:26:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:26:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2023-11-29 00:26:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:25,371 INFO L225 Difference]: With dead ends: 458 [2023-11-29 00:26:25,371 INFO L226 Difference]: Without dead ends: 230 [2023-11-29 00:26:25,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:25,372 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 101 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:25,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 754 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-29 00:26:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2023-11-29 00:26:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 155 states have internal predecessors, (197), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 00:26:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 261 transitions. [2023-11-29 00:26:25,403 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 261 transitions. Word has length 142 [2023-11-29 00:26:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:25,404 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 261 transitions. [2023-11-29 00:26:25,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 261 transitions. [2023-11-29 00:26:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 00:26:25,406 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:25,406 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:25,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:26:25,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:25,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash -85271137, now seen corresponding path program 1 times [2023-11-29 00:26:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591661412] [2023-11-29 00:26:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591661412] [2023-11-29 00:26:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591661412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:27,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:26:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702753269] [2023-11-29 00:26:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:27,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:26:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:26:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:27,070 INFO L87 Difference]: Start difference. First operand 191 states and 261 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:27,922 INFO L93 Difference]: Finished difference Result 505 states and 686 transitions. [2023-11-29 00:26:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:26:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2023-11-29 00:26:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:27,926 INFO L225 Difference]: With dead ends: 505 [2023-11-29 00:26:27,926 INFO L226 Difference]: Without dead ends: 315 [2023-11-29 00:26:27,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:26:27,928 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 170 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:27,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 648 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:26:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-29 00:26:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 204. [2023-11-29 00:26:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 168 states have internal predecessors, (215), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 00:26:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2023-11-29 00:26:27,962 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 142 [2023-11-29 00:26:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:27,963 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2023-11-29 00:26:27,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2023-11-29 00:26:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 00:26:27,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:27,965 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:27,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:26:27,965 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:27,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash 925846113, now seen corresponding path program 1 times [2023-11-29 00:26:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172156407] [2023-11-29 00:26:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:28,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:28,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172156407] [2023-11-29 00:26:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172156407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:28,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:26:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824751008] [2023-11-29 00:26:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:28,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:26:28,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:26:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:26:28,825 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:29,243 INFO L93 Difference]: Finished difference Result 478 states and 648 transitions. [2023-11-29 00:26:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:26:29,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2023-11-29 00:26:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:29,246 INFO L225 Difference]: With dead ends: 478 [2023-11-29 00:26:29,246 INFO L226 Difference]: Without dead ends: 275 [2023-11-29 00:26:29,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:26:29,248 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 167 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:29,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1129 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:26:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-29 00:26:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2023-11-29 00:26:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 367 transitions. [2023-11-29 00:26:29,298 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 367 transitions. Word has length 142 [2023-11-29 00:26:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:29,298 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 367 transitions. [2023-11-29 00:26:29,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 367 transitions. [2023-11-29 00:26:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 00:26:29,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:29,301 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:29,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:26:29,301 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:29,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash -219284643, now seen corresponding path program 1 times [2023-11-29 00:26:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308818957] [2023-11-29 00:26:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308818957] [2023-11-29 00:26:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308818957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:29,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:26:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848885428] [2023-11-29 00:26:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:29,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:26:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:29,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:26:29,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:29,715 INFO L87 Difference]: Start difference. First operand 272 states and 367 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:30,076 INFO L93 Difference]: Finished difference Result 649 states and 878 transitions. [2023-11-29 00:26:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:26:30,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2023-11-29 00:26:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:30,079 INFO L225 Difference]: With dead ends: 649 [2023-11-29 00:26:30,079 INFO L226 Difference]: Without dead ends: 378 [2023-11-29 00:26:30,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:26:30,081 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 198 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:30,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1068 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:26:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-11-29 00:26:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 276. [2023-11-29 00:26:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 221 states have (on average 1.253393665158371) internal successors, (277), 223 states have internal predecessors, (277), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 371 transitions. [2023-11-29 00:26:30,123 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 371 transitions. Word has length 142 [2023-11-29 00:26:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:30,124 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 371 transitions. [2023-11-29 00:26:30,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 371 transitions. [2023-11-29 00:26:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 00:26:30,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:30,126 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:30,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:26:30,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:30,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash 791832607, now seen corresponding path program 1 times [2023-11-29 00:26:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468647517] [2023-11-29 00:26:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:30,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:31,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:31,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468647517] [2023-11-29 00:26:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468647517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:31,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:26:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685525080] [2023-11-29 00:26:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:31,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:26:31,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:31,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:26:31,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:26:31,346 INFO L87 Difference]: Start difference. First operand 276 states and 371 transitions. Second operand has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:32,900 INFO L93 Difference]: Finished difference Result 701 states and 938 transitions. [2023-11-29 00:26:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:26:32,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2023-11-29 00:26:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:32,903 INFO L225 Difference]: With dead ends: 701 [2023-11-29 00:26:32,903 INFO L226 Difference]: Without dead ends: 426 [2023-11-29 00:26:32,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:26:32,905 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 232 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:32,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1446 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:26:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-11-29 00:26:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 271. [2023-11-29 00:26:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 218 states have internal predecessors, (271), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 365 transitions. [2023-11-29 00:26:32,944 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 365 transitions. Word has length 142 [2023-11-29 00:26:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:32,945 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 365 transitions. [2023-11-29 00:26:32,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.555555555555555) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 365 transitions. [2023-11-29 00:26:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 00:26:32,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:32,947 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:32,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:26:32,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -310840564, now seen corresponding path program 1 times [2023-11-29 00:26:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605093220] [2023-11-29 00:26:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:33,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605093220] [2023-11-29 00:26:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605093220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:26:33,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774558730] [2023-11-29 00:26:33,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:33,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:26:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:26:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:26:33,707 INFO L87 Difference]: Start difference. First operand 271 states and 365 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:34,527 INFO L93 Difference]: Finished difference Result 701 states and 942 transitions. [2023-11-29 00:26:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:26:34,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2023-11-29 00:26:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:34,531 INFO L225 Difference]: With dead ends: 701 [2023-11-29 00:26:34,531 INFO L226 Difference]: Without dead ends: 431 [2023-11-29 00:26:34,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:26:34,533 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 190 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:34,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1365 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:26:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-29 00:26:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 289. [2023-11-29 00:26:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 234 states have (on average 1.264957264957265) internal successors, (296), 236 states have internal predecessors, (296), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 390 transitions. [2023-11-29 00:26:34,588 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 390 transitions. Word has length 143 [2023-11-29 00:26:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:34,589 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 390 transitions. [2023-11-29 00:26:34,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:26:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 390 transitions. [2023-11-29 00:26:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 00:26:34,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:34,591 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:26:34,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:34,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2035147467, now seen corresponding path program 1 times [2023-11-29 00:26:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399211738] [2023-11-29 00:26:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399211738] [2023-11-29 00:26:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399211738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:26:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546623172] [2023-11-29 00:26:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:34,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:26:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:34,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:26:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:34,842 INFO L87 Difference]: Start difference. First operand 289 states and 390 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:34,972 INFO L93 Difference]: Finished difference Result 674 states and 908 transitions. [2023-11-29 00:26:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:26:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-29 00:26:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:34,976 INFO L225 Difference]: With dead ends: 674 [2023-11-29 00:26:34,976 INFO L226 Difference]: Without dead ends: 386 [2023-11-29 00:26:34,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:34,977 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 108 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:34,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 555 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-29 00:26:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 295. [2023-11-29 00:26:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.2625) internal successors, (303), 242 states have internal predecessors, (303), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 397 transitions. [2023-11-29 00:26:35,029 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 397 transitions. Word has length 143 [2023-11-29 00:26:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:35,030 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 397 transitions. [2023-11-29 00:26:35,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 397 transitions. [2023-11-29 00:26:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 00:26:35,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:35,032 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:35,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:26:35,033 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:35,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 26861387, now seen corresponding path program 1 times [2023-11-29 00:26:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:35,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424484851] [2023-11-29 00:26:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424484851] [2023-11-29 00:26:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424484851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:35,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:26:35,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936054314] [2023-11-29 00:26:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:26:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:26:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:35,290 INFO L87 Difference]: Start difference. First operand 295 states and 397 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:35,421 INFO L93 Difference]: Finished difference Result 633 states and 849 transitions. [2023-11-29 00:26:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:26:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-29 00:26:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:35,424 INFO L225 Difference]: With dead ends: 633 [2023-11-29 00:26:35,424 INFO L226 Difference]: Without dead ends: 339 [2023-11-29 00:26:35,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:26:35,426 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 103 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 541 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 [2023-11-29 00:26:35,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 541 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-29 00:26:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 295. [2023-11-29 00:26:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.2583333333333333) internal successors, (302), 242 states have internal predecessors, (302), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2023-11-29 00:26:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 396 transitions. [2023-11-29 00:26:35,478 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 396 transitions. Word has length 143 [2023-11-29 00:26:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:35,479 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 396 transitions. [2023-11-29 00:26:35,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 396 transitions. [2023-11-29 00:26:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 00:26:35,481 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:35,481 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:35,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:26:35,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:35,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -994206967, now seen corresponding path program 1 times [2023-11-29 00:26:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:35,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292510091] [2023-11-29 00:26:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292510091] [2023-11-29 00:26:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292510091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:26:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409265680] [2023-11-29 00:26:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:35,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:26:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:26:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:26:35,721 INFO L87 Difference]: Start difference. First operand 295 states and 396 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:35,866 INFO L93 Difference]: Finished difference Result 615 states and 822 transitions. [2023-11-29 00:26:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:26:35,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2023-11-29 00:26:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:35,869 INFO L225 Difference]: With dead ends: 615 [2023-11-29 00:26:35,869 INFO L226 Difference]: Without dead ends: 321 [2023-11-29 00:26:35,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:26:35,871 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 68 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:35,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 586 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-29 00:26:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2023-11-29 00:26:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 260 states have (on average 1.2538461538461538) internal successors, (326), 263 states have internal predecessors, (326), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2023-11-29 00:26:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2023-11-29 00:26:35,930 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 143 [2023-11-29 00:26:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:35,930 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2023-11-29 00:26:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:35,930 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2023-11-29 00:26:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 00:26:35,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:35,932 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:35,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:26:35,932 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:35,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2022836849, now seen corresponding path program 1 times [2023-11-29 00:26:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616470233] [2023-11-29 00:26:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616470233] [2023-11-29 00:26:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616470233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:26:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090962760] [2023-11-29 00:26:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:26:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:26:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:26:37,177 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:37,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:37,889 INFO L93 Difference]: Finished difference Result 922 states and 1235 transitions. [2023-11-29 00:26:37,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:26:37,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2023-11-29 00:26:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:37,899 INFO L225 Difference]: With dead ends: 922 [2023-11-29 00:26:37,899 INFO L226 Difference]: Without dead ends: 605 [2023-11-29 00:26:37,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:26:37,901 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 168 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:37,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 969 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:26:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-11-29 00:26:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 566. [2023-11-29 00:26:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 462 states have internal predecessors, (568), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2023-11-29 00:26:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 756 transitions. [2023-11-29 00:26:38,014 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 756 transitions. Word has length 144 [2023-11-29 00:26:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:38,015 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 756 transitions. [2023-11-29 00:26:38,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 756 transitions. [2023-11-29 00:26:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:26:38,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:38,017 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:26:38,018 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:38,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash -479832057, now seen corresponding path program 1 times [2023-11-29 00:26:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059554116] [2023-11-29 00:26:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059554116] [2023-11-29 00:26:39,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059554116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:39,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:39,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 00:26:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303711245] [2023-11-29 00:26:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:39,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:26:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:26:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:26:39,348 INFO L87 Difference]: Start difference. First operand 566 states and 756 transitions. Second operand has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:40,654 INFO L93 Difference]: Finished difference Result 1676 states and 2231 transitions. [2023-11-29 00:26:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:26:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2023-11-29 00:26:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:40,661 INFO L225 Difference]: With dead ends: 1676 [2023-11-29 00:26:40,661 INFO L226 Difference]: Without dead ends: 1111 [2023-11-29 00:26:40,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:26:40,664 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 435 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:40,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1075 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:26:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2023-11-29 00:26:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 589. [2023-11-29 00:26:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 479 states have (on average 1.2505219206680585) internal successors, (599), 485 states have internal predecessors, (599), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2023-11-29 00:26:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 787 transitions. [2023-11-29 00:26:40,771 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 787 transitions. Word has length 145 [2023-11-29 00:26:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:40,772 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 787 transitions. [2023-11-29 00:26:40,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.818181818181818) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 787 transitions. [2023-11-29 00:26:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:26:40,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:40,774 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:26:40,774 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:40,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2068179959, now seen corresponding path program 1 times [2023-11-29 00:26:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321159382] [2023-11-29 00:26:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:41,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321159382] [2023-11-29 00:26:41,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321159382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:41,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:41,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:26:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791554109] [2023-11-29 00:26:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:26:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:26:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:26:41,059 INFO L87 Difference]: Start difference. First operand 589 states and 787 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:41,656 INFO L93 Difference]: Finished difference Result 1694 states and 2257 transitions. [2023-11-29 00:26:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:26:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2023-11-29 00:26:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:41,662 INFO L225 Difference]: With dead ends: 1694 [2023-11-29 00:26:41,662 INFO L226 Difference]: Without dead ends: 1106 [2023-11-29 00:26:41,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:26:41,665 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 200 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:41,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 556 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2023-11-29 00:26:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 861. [2023-11-29 00:26:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 687 states have (on average 1.232896652110626) internal successors, (847), 697 states have internal predecessors, (847), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2023-11-29 00:26:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1147 transitions. [2023-11-29 00:26:41,879 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1147 transitions. Word has length 145 [2023-11-29 00:26:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:41,879 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1147 transitions. [2023-11-29 00:26:41,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:26:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1147 transitions. [2023-11-29 00:26:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:26:41,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:41,882 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:26:41,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:41,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1215670087, now seen corresponding path program 1 times [2023-11-29 00:26:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532114293] [2023-11-29 00:26:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:26:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:26:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:26:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:26:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:26:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:26:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:26:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:26:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:26:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:26:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:26:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:26:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:26:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:26:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:26:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532114293] [2023-11-29 00:26:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532114293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:42,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:42,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:26:42,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978105540] [2023-11-29 00:26:42,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:42,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:26:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:42,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:26:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:26:42,575 INFO L87 Difference]: Start difference. First operand 861 states and 1147 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:43,360 INFO L93 Difference]: Finished difference Result 2075 states and 2768 transitions. [2023-11-29 00:26:43,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:26:43,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2023-11-29 00:26:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:43,367 INFO L225 Difference]: With dead ends: 2075 [2023-11-29 00:26:43,368 INFO L226 Difference]: Without dead ends: 1215 [2023-11-29 00:26:43,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:43,370 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:43,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 904 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:26:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2023-11-29 00:26:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 904. [2023-11-29 00:26:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 730 states have (on average 1.2438356164383562) internal successors, (908), 740 states have internal predecessors, (908), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2023-11-29 00:26:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1208 transitions. [2023-11-29 00:26:43,548 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1208 transitions. Word has length 145 [2023-11-29 00:26:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:43,548 INFO L495 AbstractCegarLoop]: Abstraction has 904 states and 1208 transitions. [2023-11-29 00:26:43,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:26:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1208 transitions. [2023-11-29 00:26:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:26:43,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:43,551 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:43,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:26:43,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:43,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash -57130231, now seen corresponding path program 1 times [2023-11-29 00:26:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:43,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662580910] [2023-11-29 00:26:43,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:00,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:00,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662580910] [2023-11-29 00:27:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662580910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 00:27:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207295788] [2023-11-29 00:27:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:00,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:27:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:00,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:27:00,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:27:00,108 INFO L87 Difference]: Start difference. First operand 904 states and 1208 transitions. Second operand has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 00:27:02,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:27:15,446 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 00:27:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:18,441 INFO L93 Difference]: Finished difference Result 2118 states and 2821 transitions. [2023-11-29 00:27:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:27:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2023-11-29 00:27:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:18,449 INFO L225 Difference]: With dead ends: 2118 [2023-11-29 00:27:18,449 INFO L226 Difference]: Without dead ends: 1215 [2023-11-29 00:27:18,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:27:18,452 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 241 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:18,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 986 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 00:27:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2023-11-29 00:27:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 890. [2023-11-29 00:27:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 716 states have (on average 1.2402234636871508) internal successors, (888), 726 states have internal predecessors, (888), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2023-11-29 00:27:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1188 transitions. [2023-11-29 00:27:18,647 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1188 transitions. Word has length 145 [2023-11-29 00:27:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:18,647 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1188 transitions. [2023-11-29 00:27:18,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 00:27:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1188 transitions. [2023-11-29 00:27:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:18,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:18,649 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:18,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:27:18,649 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:18,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -657824557, now seen corresponding path program 1 times [2023-11-29 00:27:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944399168] [2023-11-29 00:27:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944399168] [2023-11-29 00:27:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944399168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313619430] [2023-11-29 00:27:19,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:19,195 INFO L87 Difference]: Start difference. First operand 890 states and 1188 transitions. Second operand has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:19,922 INFO L93 Difference]: Finished difference Result 2035 states and 2712 transitions. [2023-11-29 00:27:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:27:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2023-11-29 00:27:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:19,929 INFO L225 Difference]: With dead ends: 2035 [2023-11-29 00:27:19,929 INFO L226 Difference]: Without dead ends: 1146 [2023-11-29 00:27:19,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:19,931 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 114 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:19,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 736 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:27:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-29 00:27:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 890. [2023-11-29 00:27:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 716 states have (on average 1.238826815642458) internal successors, (887), 726 states have internal predecessors, (887), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2023-11-29 00:27:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1187 transitions. [2023-11-29 00:27:20,129 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1187 transitions. Word has length 145 [2023-11-29 00:27:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:20,129 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1187 transitions. [2023-11-29 00:27:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1187 transitions. [2023-11-29 00:27:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:20,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:20,131 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:20,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 00:27:20,132 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:20,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -798373167, now seen corresponding path program 1 times [2023-11-29 00:27:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90208302] [2023-11-29 00:27:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90208302] [2023-11-29 00:27:21,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90208302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:21,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:21,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 00:27:21,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612868308] [2023-11-29 00:27:21,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:21,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:27:21,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:27:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:27:21,056 INFO L87 Difference]: Start difference. First operand 890 states and 1187 transitions. Second operand has 13 states, 10 states have (on average 5.3) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 00:27:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:22,450 INFO L93 Difference]: Finished difference Result 2231 states and 2969 transitions. [2023-11-29 00:27:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:27:22,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.3) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2023-11-29 00:27:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:22,458 INFO L225 Difference]: With dead ends: 2231 [2023-11-29 00:27:22,459 INFO L226 Difference]: Without dead ends: 1342 [2023-11-29 00:27:22,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:27:22,461 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 270 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1601 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:27:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-29 00:27:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 890. [2023-11-29 00:27:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 716 states have (on average 1.2360335195530727) internal successors, (885), 726 states have internal predecessors, (885), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2023-11-29 00:27:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1185 transitions. [2023-11-29 00:27:22,708 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1185 transitions. Word has length 145 [2023-11-29 00:27:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:22,708 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1185 transitions. [2023-11-29 00:27:22,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.3) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 00:27:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1185 transitions. [2023-11-29 00:27:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:22,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:22,711 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:22,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 00:27:22,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:22,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash -989305147, now seen corresponding path program 1 times [2023-11-29 00:27:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939363588] [2023-11-29 00:27:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939363588] [2023-11-29 00:27:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939363588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:27:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023340959] [2023-11-29 00:27:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:27:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:27:23,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:23,424 INFO L87 Difference]: Start difference. First operand 890 states and 1185 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:24,251 INFO L93 Difference]: Finished difference Result 1795 states and 2378 transitions. [2023-11-29 00:27:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:27:24,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2023-11-29 00:27:24,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:24,256 INFO L225 Difference]: With dead ends: 1795 [2023-11-29 00:27:24,256 INFO L226 Difference]: Without dead ends: 906 [2023-11-29 00:27:24,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:27:24,258 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 140 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:24,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 672 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:27:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2023-11-29 00:27:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 763. [2023-11-29 00:27:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 617 states have (on average 1.2252836304700163) internal successors, (756), 625 states have internal predecessors, (756), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-29 00:27:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1004 transitions. [2023-11-29 00:27:24,566 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1004 transitions. Word has length 145 [2023-11-29 00:27:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:24,566 INFO L495 AbstractCegarLoop]: Abstraction has 763 states and 1004 transitions. [2023-11-29 00:27:24,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1004 transitions. [2023-11-29 00:27:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:24,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:24,569 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:24,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 00:27:24,569 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:24,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 706196997, now seen corresponding path program 1 times [2023-11-29 00:27:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541690176] [2023-11-29 00:27:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:25,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541690176] [2023-11-29 00:27:25,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541690176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:25,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:25,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:27:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828031550] [2023-11-29 00:27:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:27:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:25,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:27:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:25,038 INFO L87 Difference]: Start difference. First operand 763 states and 1004 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:25,712 INFO L93 Difference]: Finished difference Result 1649 states and 2169 transitions. [2023-11-29 00:27:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:27:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2023-11-29 00:27:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:25,717 INFO L225 Difference]: With dead ends: 1649 [2023-11-29 00:27:25,717 INFO L226 Difference]: Without dead ends: 887 [2023-11-29 00:27:25,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:27:25,719 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 144 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:25,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1105 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:27:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2023-11-29 00:27:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 753. [2023-11-29 00:27:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 607 states have (on average 1.2224052718286655) internal successors, (742), 615 states have internal predecessors, (742), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2023-11-29 00:27:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 990 transitions. [2023-11-29 00:27:25,924 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 990 transitions. Word has length 145 [2023-11-29 00:27:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:25,924 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 990 transitions. [2023-11-29 00:27:25,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 990 transitions. [2023-11-29 00:27:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:25,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:25,927 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:25,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 00:27:25,927 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:25,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1847805971, now seen corresponding path program 1 times [2023-11-29 00:27:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219019328] [2023-11-29 00:27:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:26,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219019328] [2023-11-29 00:27:26,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219019328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:26,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:26,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:27:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124415808] [2023-11-29 00:27:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:27:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:27:26,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:26,299 INFO L87 Difference]: Start difference. First operand 753 states and 990 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:26,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:26,954 INFO L93 Difference]: Finished difference Result 1594 states and 2090 transitions. [2023-11-29 00:27:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:27:26,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2023-11-29 00:27:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:26,960 INFO L225 Difference]: With dead ends: 1594 [2023-11-29 00:27:26,960 INFO L226 Difference]: Without dead ends: 842 [2023-11-29 00:27:26,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:27:26,962 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:26,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 950 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:27:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2023-11-29 00:27:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 497. [2023-11-29 00:27:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 415 states have (on average 1.23855421686747) internal successors, (514), 419 states have internal predecessors, (514), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 650 transitions. [2023-11-29 00:27:27,102 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 650 transitions. Word has length 145 [2023-11-29 00:27:27,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:27,102 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 650 transitions. [2023-11-29 00:27:27,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 650 transitions. [2023-11-29 00:27:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-29 00:27:27,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:27,103 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:27,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 00:27:27,104 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:27,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1038927602, now seen corresponding path program 1 times [2023-11-29 00:27:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174250642] [2023-11-29 00:27:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174250642] [2023-11-29 00:27:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174250642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:27,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:27:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76355556] [2023-11-29 00:27:27,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:27,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:27:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:27,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:27:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:27,550 INFO L87 Difference]: Start difference. First operand 497 states and 650 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:28,373 INFO L93 Difference]: Finished difference Result 1058 states and 1386 transitions. [2023-11-29 00:27:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:27:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2023-11-29 00:27:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:28,376 INFO L225 Difference]: With dead ends: 1058 [2023-11-29 00:27:28,376 INFO L226 Difference]: Without dead ends: 562 [2023-11-29 00:27:28,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:27:28,377 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 184 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:28,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1296 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:27:28,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-11-29 00:27:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 501. [2023-11-29 00:27:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 419 states have (on average 1.233890214797136) internal successors, (517), 423 states have internal predecessors, (517), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 653 transitions. [2023-11-29 00:27:28,500 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 653 transitions. Word has length 145 [2023-11-29 00:27:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:28,501 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 653 transitions. [2023-11-29 00:27:28,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 653 transitions. [2023-11-29 00:27:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 00:27:28,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:28,503 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 00:27:28,503 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:28,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2093325592, now seen corresponding path program 1 times [2023-11-29 00:27:28,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:28,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405489746] [2023-11-29 00:27:28,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405489746] [2023-11-29 00:27:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405489746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:27:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871972836] [2023-11-29 00:27:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:28,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:27:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:28,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:27:28,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:28,782 INFO L87 Difference]: Start difference. First operand 501 states and 653 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:29,091 INFO L93 Difference]: Finished difference Result 1241 states and 1620 transitions. [2023-11-29 00:27:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:27:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-29 00:27:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:29,096 INFO L225 Difference]: With dead ends: 1241 [2023-11-29 00:27:29,096 INFO L226 Difference]: Without dead ends: 741 [2023-11-29 00:27:29,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:27:29,097 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 235 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:29,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 815 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:27:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-29 00:27:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 529. [2023-11-29 00:27:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 447 states have (on average 1.2192393736017897) internal successors, (545), 451 states have internal predecessors, (545), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 681 transitions. [2023-11-29 00:27:29,280 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 681 transitions. Word has length 146 [2023-11-29 00:27:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:29,280 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 681 transitions. [2023-11-29 00:27:29,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 681 transitions. [2023-11-29 00:27:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 00:27:29,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:29,282 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:29,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 00:27:29,282 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:29,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1383993254, now seen corresponding path program 1 times [2023-11-29 00:27:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:29,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341708449] [2023-11-29 00:27:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341708449] [2023-11-29 00:27:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341708449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:27:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018994379] [2023-11-29 00:27:29,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:29,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:27:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:27:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:27:29,487 INFO L87 Difference]: Start difference. First operand 529 states and 681 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:29,740 INFO L93 Difference]: Finished difference Result 1089 states and 1407 transitions. [2023-11-29 00:27:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:27:29,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-29 00:27:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:29,744 INFO L225 Difference]: With dead ends: 1089 [2023-11-29 00:27:29,744 INFO L226 Difference]: Without dead ends: 561 [2023-11-29 00:27:29,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:29,745 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 119 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:29,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 660 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:27:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2023-11-29 00:27:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 505. [2023-11-29 00:27:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 423 states have (on average 1.2245862884160756) internal successors, (518), 427 states have internal predecessors, (518), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 654 transitions. [2023-11-29 00:27:29,948 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 654 transitions. Word has length 146 [2023-11-29 00:27:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:29,948 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 654 transitions. [2023-11-29 00:27:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 654 transitions. [2023-11-29 00:27:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 00:27:29,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:29,950 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:27:29,950 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:29,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1064505622, now seen corresponding path program 1 times [2023-11-29 00:27:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925229623] [2023-11-29 00:27:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925229623] [2023-11-29 00:27:30,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925229623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:30,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:30,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:27:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745571611] [2023-11-29 00:27:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:30,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:27:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:27:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:27:30,161 INFO L87 Difference]: Start difference. First operand 505 states and 654 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:30,368 INFO L93 Difference]: Finished difference Result 999 states and 1296 transitions. [2023-11-29 00:27:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-29 00:27:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:30,371 INFO L225 Difference]: With dead ends: 999 [2023-11-29 00:27:30,371 INFO L226 Difference]: Without dead ends: 493 [2023-11-29 00:27:30,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:30,372 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 195 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:30,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 575 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:27:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-29 00:27:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2023-11-29 00:27:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 409 states have (on average 1.2273838630806846) internal successors, (502), 413 states have internal predecessors, (502), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 638 transitions. [2023-11-29 00:27:30,504 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 638 transitions. Word has length 146 [2023-11-29 00:27:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:30,505 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 638 transitions. [2023-11-29 00:27:30,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 638 transitions. [2023-11-29 00:27:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 00:27:30,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:30,506 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:30,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 00:27:30,506 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:30,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash -929639084, now seen corresponding path program 1 times [2023-11-29 00:27:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830787475] [2023-11-29 00:27:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:30,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830787475] [2023-11-29 00:27:30,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830787475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:30,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:30,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:27:30,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861150809] [2023-11-29 00:27:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:30,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:27:30,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:30,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:27:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:27:30,717 INFO L87 Difference]: Start difference. First operand 491 states and 638 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:30,931 INFO L93 Difference]: Finished difference Result 989 states and 1286 transitions. [2023-11-29 00:27:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-11-29 00:27:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:30,934 INFO L225 Difference]: With dead ends: 989 [2023-11-29 00:27:30,934 INFO L226 Difference]: Without dead ends: 499 [2023-11-29 00:27:30,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:30,936 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 173 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:30,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 590 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:27:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-11-29 00:27:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 485. [2023-11-29 00:27:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 403 states have (on average 1.2233250620347396) internal successors, (493), 407 states have internal predecessors, (493), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 629 transitions. [2023-11-29 00:27:31,063 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 629 transitions. Word has length 146 [2023-11-29 00:27:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 629 transitions. [2023-11-29 00:27:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 629 transitions. [2023-11-29 00:27:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:31,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:31,065 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:31,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 00:27:31,065 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:31,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -847228276, now seen corresponding path program 1 times [2023-11-29 00:27:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:31,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317871838] [2023-11-29 00:27:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:31,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317871838] [2023-11-29 00:27:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317871838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 00:27:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243806607] [2023-11-29 00:27:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:31,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:27:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:27:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:27:31,805 INFO L87 Difference]: Start difference. First operand 485 states and 629 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:32,830 INFO L93 Difference]: Finished difference Result 1179 states and 1525 transitions. [2023-11-29 00:27:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:27:32,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-29 00:27:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:32,835 INFO L225 Difference]: With dead ends: 1179 [2023-11-29 00:27:32,835 INFO L226 Difference]: Without dead ends: 695 [2023-11-29 00:27:32,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:27:32,837 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 175 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:32,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1178 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:27:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2023-11-29 00:27:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 487. [2023-11-29 00:27:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 405 states have (on average 1.2222222222222223) internal successors, (495), 409 states have internal predecessors, (495), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-29 00:27:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 631 transitions. [2023-11-29 00:27:32,981 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 631 transitions. Word has length 147 [2023-11-29 00:27:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:32,982 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 631 transitions. [2023-11-29 00:27:32,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 631 transitions. [2023-11-29 00:27:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:32,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:32,983 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:32,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 00:27:32,983 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:32,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:32,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1858345526, now seen corresponding path program 1 times [2023-11-29 00:27:32,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:32,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477751438] [2023-11-29 00:27:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:33,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477751438] [2023-11-29 00:27:33,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477751438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:33,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:27:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276005232] [2023-11-29 00:27:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:33,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:27:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:27:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:33,334 INFO L87 Difference]: Start difference. First operand 487 states and 631 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:34,446 INFO L93 Difference]: Finished difference Result 1626 states and 2082 transitions. [2023-11-29 00:27:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:27:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-29 00:27:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:34,451 INFO L225 Difference]: With dead ends: 1626 [2023-11-29 00:27:34,451 INFO L226 Difference]: Without dead ends: 1140 [2023-11-29 00:27:34,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:27:34,452 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 249 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:34,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 893 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:27:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2023-11-29 00:27:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 586. [2023-11-29 00:27:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 501 states have (on average 1.2095808383233533) internal successors, (606), 506 states have internal predecessors, (606), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 00:27:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 746 transitions. [2023-11-29 00:27:34,609 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 746 transitions. Word has length 147 [2023-11-29 00:27:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:34,609 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 746 transitions. [2023-11-29 00:27:34,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 746 transitions. [2023-11-29 00:27:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:34,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:34,611 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:34,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 00:27:34,611 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:34,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1435643700, now seen corresponding path program 1 times [2023-11-29 00:27:34,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:34,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817951663] [2023-11-29 00:27:34,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:34,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817951663] [2023-11-29 00:27:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817951663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:27:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474475697] [2023-11-29 00:27:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:34,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:27:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:27:34,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:27:34,931 INFO L87 Difference]: Start difference. First operand 586 states and 746 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:35,561 INFO L93 Difference]: Finished difference Result 1404 states and 1779 transitions. [2023-11-29 00:27:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:35,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-29 00:27:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:35,565 INFO L225 Difference]: With dead ends: 1404 [2023-11-29 00:27:35,565 INFO L226 Difference]: Without dead ends: 819 [2023-11-29 00:27:35,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:35,566 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 165 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:35,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 728 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2023-11-29 00:27:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 579. [2023-11-29 00:27:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 494 states have (on average 1.2064777327935223) internal successors, (596), 499 states have internal predecessors, (596), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 00:27:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 736 transitions. [2023-11-29 00:27:35,717 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 736 transitions. Word has length 147 [2023-11-29 00:27:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:35,717 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 736 transitions. [2023-11-29 00:27:35,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 736 transitions. [2023-11-29 00:27:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:35,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:35,719 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:35,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 00:27:35,719 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:35,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:35,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1500833140, now seen corresponding path program 1 times [2023-11-29 00:27:35,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:35,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630876186] [2023-11-29 00:27:35,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:35,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:36,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630876186] [2023-11-29 00:27:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630876186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:27:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032306455] [2023-11-29 00:27:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:36,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:27:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:27:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:27:36,024 INFO L87 Difference]: Start difference. First operand 579 states and 736 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:36,695 INFO L93 Difference]: Finished difference Result 1368 states and 1739 transitions. [2023-11-29 00:27:36,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:27:36,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-29 00:27:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:36,699 INFO L225 Difference]: With dead ends: 1368 [2023-11-29 00:27:36,699 INFO L226 Difference]: Without dead ends: 790 [2023-11-29 00:27:36,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:27:36,700 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 184 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:36,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1815 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-11-29 00:27:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 769. [2023-11-29 00:27:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 640 states have (on average 1.190625) internal successors, (762), 647 states have internal predecessors, (762), 106 states have call successors, (106), 22 states have call predecessors, (106), 22 states have return successors, (106), 99 states have call predecessors, (106), 106 states have call successors, (106) [2023-11-29 00:27:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 974 transitions. [2023-11-29 00:27:36,995 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 974 transitions. Word has length 147 [2023-11-29 00:27:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:36,996 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 974 transitions. [2023-11-29 00:27:36,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 974 transitions. [2023-11-29 00:27:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:36,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:36,997 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:36,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 00:27:36,997 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:36,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 870906122, now seen corresponding path program 1 times [2023-11-29 00:27:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607123734] [2023-11-29 00:27:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:36,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607123734] [2023-11-29 00:27:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607123734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866437243] [2023-11-29 00:27:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:37,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:37,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:37,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:37,340 INFO L87 Difference]: Start difference. First operand 769 states and 974 transitions. Second operand has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:38,085 INFO L93 Difference]: Finished difference Result 1628 states and 2060 transitions. [2023-11-29 00:27:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:27:38,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2023-11-29 00:27:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:38,089 INFO L225 Difference]: With dead ends: 1628 [2023-11-29 00:27:38,089 INFO L226 Difference]: Without dead ends: 860 [2023-11-29 00:27:38,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:38,090 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 106 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:38,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 545 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:27:38,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-29 00:27:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 716. [2023-11-29 00:27:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 587 states have (on average 1.1839863713798977) internal successors, (695), 594 states have internal predecessors, (695), 106 states have call successors, (106), 22 states have call predecessors, (106), 22 states have return successors, (106), 99 states have call predecessors, (106), 106 states have call successors, (106) [2023-11-29 00:27:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 907 transitions. [2023-11-29 00:27:38,328 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 907 transitions. Word has length 147 [2023-11-29 00:27:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:38,329 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 907 transitions. [2023-11-29 00:27:38,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.0) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 00:27:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 907 transitions. [2023-11-29 00:27:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:38,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:38,330 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:38,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 00:27:38,330 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:38,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1965765724, now seen corresponding path program 1 times [2023-11-29 00:27:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:38,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76364288] [2023-11-29 00:27:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76364288] [2023-11-29 00:27:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76364288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931129919] [2023-11-29 00:27:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:39,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:39,327 INFO L87 Difference]: Start difference. First operand 716 states and 907 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:39,952 INFO L93 Difference]: Finished difference Result 793 states and 1002 transitions. [2023-11-29 00:27:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2023-11-29 00:27:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:39,956 INFO L225 Difference]: With dead ends: 793 [2023-11-29 00:27:39,957 INFO L226 Difference]: Without dead ends: 791 [2023-11-29 00:27:39,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:39,957 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 89 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:39,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 665 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-11-29 00:27:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 440. [2023-11-29 00:27:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 374 states have (on average 1.2058823529411764) internal successors, (451), 377 states have internal predecessors, (451), 53 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 00:27:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 557 transitions. [2023-11-29 00:27:40,093 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 557 transitions. Word has length 147 [2023-11-29 00:27:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:40,093 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 557 transitions. [2023-11-29 00:27:40,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:27:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 557 transitions. [2023-11-29 00:27:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:40,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:40,094 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:40,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 00:27:40,094 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:40,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:40,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1965825306, now seen corresponding path program 1 times [2023-11-29 00:27:40,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:40,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184967136] [2023-11-29 00:27:40,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:40,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184967136] [2023-11-29 00:27:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184967136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:27:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302682663] [2023-11-29 00:27:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:40,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:27:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:27:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:27:40,346 INFO L87 Difference]: Start difference. First operand 440 states and 557 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:40,598 INFO L93 Difference]: Finished difference Result 914 states and 1153 transitions. [2023-11-29 00:27:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:27:40,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-29 00:27:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:40,601 INFO L225 Difference]: With dead ends: 914 [2023-11-29 00:27:40,601 INFO L226 Difference]: Without dead ends: 475 [2023-11-29 00:27:40,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:40,602 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:40,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 531 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:27:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-11-29 00:27:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 474. [2023-11-29 00:27:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 395 states have (on average 1.1848101265822786) internal successors, (468), 399 states have internal predecessors, (468), 62 states have call successors, (62), 16 states have call predecessors, (62), 16 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2023-11-29 00:27:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 592 transitions. [2023-11-29 00:27:40,774 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 592 transitions. Word has length 147 [2023-11-29 00:27:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:40,774 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 592 transitions. [2023-11-29 00:27:40,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 592 transitions. [2023-11-29 00:27:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 00:27:40,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:40,775 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:40,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 00:27:40,776 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:40,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2023083608, now seen corresponding path program 1 times [2023-11-29 00:27:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115910984] [2023-11-29 00:27:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:27:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:27:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 00:27:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:27:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:27:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 00:27:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:27:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 00:27:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 00:27:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 00:27:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:27:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:27:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:27:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:27:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 00:27:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:27:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:27:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 00:27:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 00:27:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:40,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:40,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115910984] [2023-11-29 00:27:40,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115910984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:40,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:40,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:27:40,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338997547] [2023-11-29 00:27:40,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:40,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:27:40,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:40,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:27:40,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:27:40,900 INFO L87 Difference]: Start difference. First operand 474 states and 592 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:41,122 INFO L93 Difference]: Finished difference Result 949 states and 1181 transitions. [2023-11-29 00:27:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:27:41,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2023-11-29 00:27:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:41,124 INFO L225 Difference]: With dead ends: 949 [2023-11-29 00:27:41,124 INFO L226 Difference]: Without dead ends: 498 [2023-11-29 00:27:41,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:41,125 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 16 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:41,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 507 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:27:41,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-29 00:27:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 486. [2023-11-29 00:27:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 407 states have (on average 1.1793611793611793) internal successors, (480), 411 states have internal predecessors, (480), 62 states have call successors, (62), 16 states have call predecessors, (62), 16 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2023-11-29 00:27:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 604 transitions. [2023-11-29 00:27:41,297 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 604 transitions. Word has length 147 [2023-11-29 00:27:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:41,297 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 604 transitions. [2023-11-29 00:27:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 604 transitions. [2023-11-29 00:27:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 00:27:41,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:41,298 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:41,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 00:27:41,298 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:41,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:41,299 INFO L85 PathProgramCache]: Analyzing trace with hash 17285203, now seen corresponding path program 1 times [2023-11-29 00:27:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:41,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28993974] [2023-11-29 00:27:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:41,317 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:27:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565973239] [2023-11-29 00:27:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:27:41,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:27:41,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:27:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:41,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:27:41,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:41,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:27:41,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 18 [2023-11-29 00:27:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:41,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28993974] [2023-11-29 00:27:41,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:27:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565973239] [2023-11-29 00:27:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565973239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205298789] [2023-11-29 00:27:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:41,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:41,666 INFO L87 Difference]: Start difference. First operand 486 states and 604 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:42,294 INFO L93 Difference]: Finished difference Result 1303 states and 1600 transitions. [2023-11-29 00:27:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:42,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-29 00:27:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:42,299 INFO L225 Difference]: With dead ends: 1303 [2023-11-29 00:27:42,299 INFO L226 Difference]: Without dead ends: 840 [2023-11-29 00:27:42,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:42,300 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 110 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:42,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 457 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2023-11-29 00:27:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 685. [2023-11-29 00:27:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 590 states have (on average 1.1627118644067798) internal successors, (686), 595 states have internal predecessors, (686), 75 states have call successors, (75), 19 states have call predecessors, (75), 19 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2023-11-29 00:27:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 836 transitions. [2023-11-29 00:27:42,537 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 836 transitions. Word has length 149 [2023-11-29 00:27:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:42,537 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 836 transitions. [2023-11-29 00:27:42,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 836 transitions. [2023-11-29 00:27:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 00:27:42,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:42,539 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:42,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:27:42,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 00:27:42,739 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:42,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash 275450641, now seen corresponding path program 1 times [2023-11-29 00:27:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:42,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316608990] [2023-11-29 00:27:42,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:42,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:42,762 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:27:42,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803112413] [2023-11-29 00:27:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:42,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:42,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:27:42,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:27:42,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:27:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:42,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 00:27:42,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:43,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:27:43,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 35 [2023-11-29 00:27:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:43,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316608990] [2023-11-29 00:27:43,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:27:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803112413] [2023-11-29 00:27:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803112413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722030104] [2023-11-29 00:27:43,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:43,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:43,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:43,193 INFO L87 Difference]: Start difference. First operand 685 states and 836 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:44,013 INFO L93 Difference]: Finished difference Result 1476 states and 1788 transitions. [2023-11-29 00:27:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-29 00:27:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:44,017 INFO L225 Difference]: With dead ends: 1476 [2023-11-29 00:27:44,017 INFO L226 Difference]: Without dead ends: 814 [2023-11-29 00:27:44,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:27:44,019 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 79 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:44,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 617 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2023-11-29 00:27:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 783. [2023-11-29 00:27:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 654 states have (on average 1.1406727828746177) internal successors, (746), 662 states have internal predecessors, (746), 101 states have call successors, (101), 27 states have call predecessors, (101), 27 states have return successors, (101), 93 states have call predecessors, (101), 101 states have call successors, (101) [2023-11-29 00:27:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 948 transitions. [2023-11-29 00:27:44,354 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 948 transitions. Word has length 149 [2023-11-29 00:27:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:44,355 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 948 transitions. [2023-11-29 00:27:44,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 948 transitions. [2023-11-29 00:27:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 00:27:44,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:44,357 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:44,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:27:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-11-29 00:27:44,558 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:44,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1940513237, now seen corresponding path program 1 times [2023-11-29 00:27:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100854303] [2023-11-29 00:27:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:44,606 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:27:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735101878] [2023-11-29 00:27:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:44,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:27:44,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:27:44,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:27:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:44,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 00:27:44,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:44,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:27:44,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 21 [2023-11-29 00:27:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:44,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100854303] [2023-11-29 00:27:44,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:27:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735101878] [2023-11-29 00:27:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735101878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:27:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953412647] [2023-11-29 00:27:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:44,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:27:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:27:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:27:44,898 INFO L87 Difference]: Start difference. First operand 783 states and 948 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:45,679 INFO L93 Difference]: Finished difference Result 1958 states and 2348 transitions. [2023-11-29 00:27:45,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:27:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-29 00:27:45,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:45,686 INFO L225 Difference]: With dead ends: 1958 [2023-11-29 00:27:45,686 INFO L226 Difference]: Without dead ends: 1202 [2023-11-29 00:27:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:45,688 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 94 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 495 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 00:27:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-11-29 00:27:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1008. [2023-11-29 00:27:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 864 states have (on average 1.1423611111111112) internal successors, (987), 873 states have internal predecessors, (987), 112 states have call successors, (112), 31 states have call predecessors, (112), 31 states have return successors, (112), 103 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-29 00:27:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1211 transitions. [2023-11-29 00:27:46,163 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1211 transitions. Word has length 149 [2023-11-29 00:27:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:46,163 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1211 transitions. [2023-11-29 00:27:46,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1211 transitions. [2023-11-29 00:27:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 00:27:46,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:46,164 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:46,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:27:46,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-11-29 00:27:46,366 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:46,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2096288621, now seen corresponding path program 1 times [2023-11-29 00:27:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117836025] [2023-11-29 00:27:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:46,471 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:27:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748837200] [2023-11-29 00:27:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:46,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:27:46,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:27:46,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:27:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:46,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:27:46,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:46,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:27:46,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 26 [2023-11-29 00:27:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:46,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117836025] [2023-11-29 00:27:46,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:27:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748837200] [2023-11-29 00:27:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748837200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:46,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:46,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:27:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575220931] [2023-11-29 00:27:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:27:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:46,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:27:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:27:46,833 INFO L87 Difference]: Start difference. First operand 1008 states and 1211 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:27:47,818 INFO L93 Difference]: Finished difference Result 2284 states and 2712 transitions. [2023-11-29 00:27:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:27:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2023-11-29 00:27:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:27:47,824 INFO L225 Difference]: With dead ends: 2284 [2023-11-29 00:27:47,824 INFO L226 Difference]: Without dead ends: 1307 [2023-11-29 00:27:47,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:27:47,826 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 68 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:27:47,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 682 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:27:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2023-11-29 00:27:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1135. [2023-11-29 00:27:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 991 states have (on average 1.1261352169525731) internal successors, (1116), 1000 states have internal predecessors, (1116), 112 states have call successors, (112), 31 states have call predecessors, (112), 31 states have return successors, (112), 103 states have call predecessors, (112), 112 states have call successors, (112) [2023-11-29 00:27:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1340 transitions. [2023-11-29 00:27:48,278 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1340 transitions. Word has length 149 [2023-11-29 00:27:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:27:48,278 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 1340 transitions. [2023-11-29 00:27:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1340 transitions. [2023-11-29 00:27:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 00:27:48,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:27:48,280 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:27:48,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:27:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-11-29 00:27:48,481 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:27:48,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:27:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -52189520, now seen corresponding path program 1 times [2023-11-29 00:27:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:27:48,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678942782] [2023-11-29 00:27:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:27:48,501 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:27:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941265024] [2023-11-29 00:27:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:27:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:27:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:27:48,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:27:48,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:27:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:27:48,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-29 00:27:48,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:27:49,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:27:49,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 44 [2023-11-29 00:27:49,313 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 47 treesize of output 35 [2023-11-29 00:27:49,318 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 46 treesize of output 26 [2023-11-29 00:27:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:27:49,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:27:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:27:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678942782] [2023-11-29 00:27:49,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:27:49,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941265024] [2023-11-29 00:27:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941265024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:27:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:27:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:27:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006585258] [2023-11-29 00:27:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:27:49,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:27:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:27:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:27:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:27:49,808 INFO L87 Difference]: Start difference. First operand 1135 states and 1340 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:27:53,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:27:55,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:28:02,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:28:05,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:28:09,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 00:28:13,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 00:28:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:13,843 INFO L93 Difference]: Finished difference Result 2807 states and 3272 transitions. [2023-11-29 00:28:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:28:13,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-11-29 00:28:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:13,850 INFO L225 Difference]: With dead ends: 2807 [2023-11-29 00:28:13,850 INFO L226 Difference]: Without dead ends: 1703 [2023-11-29 00:28:13,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:13,852 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 63 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:13,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 469 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 2 Unknown, 0 Unchecked, 23.4s Time] [2023-11-29 00:28:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2023-11-29 00:28:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1671. [2023-11-29 00:28:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1472 states have (on average 1.106657608695652) internal successors, (1629), 1489 states have internal predecessors, (1629), 152 states have call successors, (152), 46 states have call predecessors, (152), 46 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2023-11-29 00:28:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1933 transitions. [2023-11-29 00:28:14,415 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1933 transitions. Word has length 150 [2023-11-29 00:28:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:14,415 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 1933 transitions. [2023-11-29 00:28:14,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:28:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1933 transitions. [2023-11-29 00:28:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 00:28:14,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:28:14,417 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:28:14,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:28:14,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-11-29 00:28:14,617 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:28:14,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -445216530, now seen corresponding path program 1 times [2023-11-29 00:28:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800393851] [2023-11-29 00:28:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:14,635 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:28:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192423566] [2023-11-29 00:28:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:28:14,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:28:14,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:28:14,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:28:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:14,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:28:14,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:28:14,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:28:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:14,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800393851] [2023-11-29 00:28:14,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:28:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192423566] [2023-11-29 00:28:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192423566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:14,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:28:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365622815] [2023-11-29 00:28:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:14,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:28:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:14,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:28:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:28:14,864 INFO L87 Difference]: Start difference. First operand 1671 states and 1933 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:28:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:15,530 INFO L93 Difference]: Finished difference Result 3379 states and 3895 transitions. [2023-11-29 00:28:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:28:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-11-29 00:28:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:15,533 INFO L225 Difference]: With dead ends: 3379 [2023-11-29 00:28:15,533 INFO L226 Difference]: Without dead ends: 1743 [2023-11-29 00:28:15,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:28:15,535 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 23 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:15,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 634 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:28:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2023-11-29 00:28:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1623. [2023-11-29 00:28:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1424 states have (on average 1.0990168539325842) internal successors, (1565), 1441 states have internal predecessors, (1565), 152 states have call successors, (152), 46 states have call predecessors, (152), 46 states have return successors, (152), 135 states have call predecessors, (152), 152 states have call successors, (152) [2023-11-29 00:28:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 1869 transitions. [2023-11-29 00:28:16,086 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 1869 transitions. Word has length 150 [2023-11-29 00:28:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:16,086 INFO L495 AbstractCegarLoop]: Abstraction has 1623 states and 1869 transitions. [2023-11-29 00:28:16,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:28:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1869 transitions. [2023-11-29 00:28:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 00:28:16,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:28:16,088 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:28:16,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 00:28:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-11-29 00:28:16,289 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:28:16,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:28:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -114229134, now seen corresponding path program 1 times [2023-11-29 00:28:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:28:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051558096] [2023-11-29 00:28:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:28:16,307 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:28:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33271033] [2023-11-29 00:28:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:28:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:28:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:28:16,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:28:16,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:28:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:28:16,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:28:16,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:28:16,563 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 [2023-11-29 00:28:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-29 00:28:16,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:28:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-29 00:28:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:28:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051558096] [2023-11-29 00:28:16,729 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:28:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33271033] [2023-11-29 00:28:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33271033] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:28:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:28:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2023-11-29 00:28:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527143065] [2023-11-29 00:28:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:16,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:28:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:28:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:28:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:28:16,731 INFO L87 Difference]: Start difference. First operand 1623 states and 1869 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:28:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:28:17,987 INFO L93 Difference]: Finished difference Result 4479 states and 5139 transitions. [2023-11-29 00:28:17,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:28:17,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-11-29 00:28:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:28:17,988 INFO L225 Difference]: With dead ends: 4479 [2023-11-29 00:28:17,988 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:28:17,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:28:17,993 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 136 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:28:17,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1306 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:28:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:28:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:28:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2023-11-29 00:28:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:28:17,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2023-11-29 00:28:17,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:28:17,995 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:28:17,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-29 00:28:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:28:17,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:28:17,997 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:28:18,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 00:28:18,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b092428-9613-4ec6-b604-2895c371e63f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-11-29 00:28:18,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.