./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme --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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:51:08,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:51:09,076 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:51:09,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:51:09,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:51:09,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:51:09,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:51:09,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:51:09,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:51:09,109 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:51:09,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:51:09,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:51:09,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:51:09,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:51:09,112 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:51:09,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:51:09,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:51:09,114 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:51:09,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:51:09,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:51:09,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:51:09,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:51:09,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:51:09,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:51:09,118 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:51:09,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:51:09,119 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:51:09,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:51:09,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:51:09,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:51:09,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:51:09,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:09,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:51:09,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:51:09,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:51:09,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:51:09,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:51:09,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:51:09,123 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:51:09,124 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:51:09,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:51:09,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:51:09,125 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_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/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_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2023-11-26 11:51:09,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:51:09,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:51:09,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:51:09,489 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:51:09,491 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:51:09,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2023-11-26 11:51:12,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:51:12,992 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:51:12,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2023-11-26 11:51:13,008 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/data/d1c9813c2/ed261ce3ebb34a34b713ed97b968da9c/FLAGc49902899 [2023-11-26 11:51:13,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/data/d1c9813c2/ed261ce3ebb34a34b713ed97b968da9c [2023-11-26 11:51:13,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:51:13,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:51:13,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:13,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:51:13,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:51:13,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f83aa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13, skipping insertion in model container [2023-11-26 11:51:13,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:51:13,296 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_4a32c6f4-1381-4666-a268-d60d194e3389/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2023-11-26 11:51:13,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:13,381 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:51:13,395 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_4a32c6f4-1381-4666-a268-d60d194e3389/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2023-11-26 11:51:13,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:51:13,473 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:51:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13 WrapperNode [2023-11-26 11:51:13,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:51:13,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:13,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:51:13,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:51:13,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,583 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2023-11-26 11:51:13,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:51:13,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:51:13,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:51:13,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:51:13,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,665 INFO L175 MemorySlicer]: Split 151 memory accesses to 2 slices as follows [2, 149]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2023-11-26 11:51:13,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:51:13,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:51:13,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:51:13,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:51:13,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (1/1) ... [2023-11-26 11:51:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:51:13,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:51:13,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:51:13,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a32c6f4-1381-4666-a268-d60d194e3389/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:51:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:51:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-26 11:51:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-26 11:51:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:51:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:51:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-26 11:51:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-26 11:51:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:51:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:51:13,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-26 11:51:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-26 11:51:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:51:13,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:51:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:51:13,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:51:13,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:51:13,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:51:14,090 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:51:14,092 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:51:14,694 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:51:14,737 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:51:14,737 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:51:14,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:14 BoogieIcfgContainer [2023-11-26 11:51:14,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:51:14,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:51:14,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:51:14,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:51:14,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:51:13" (1/3) ... [2023-11-26 11:51:14,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c62a9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:14, skipping insertion in model container [2023-11-26 11:51:14,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:51:13" (2/3) ... [2023-11-26 11:51:14,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c62a9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:51:14, skipping insertion in model container [2023-11-26 11:51:14,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:51:14" (3/3) ... [2023-11-26 11:51:14,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2023-11-26 11:51:14,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:51:14,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:51:14,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:51:14,837 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;@496e5c4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:51:14,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:51:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:51:14,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:14,872 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:14,872 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:14,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1734083132, now seen corresponding path program 1 times [2023-11-26 11:51:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395961628] [2023-11-26 11:51:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:14,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:15,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:15,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395961628] [2023-11-26 11:51:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395961628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48083918] [2023-11-26 11:51:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:15,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:51:15,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:51:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:51:15,553 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:15,632 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-11-26 11:51:15,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:51:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:51:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:15,645 INFO L225 Difference]: With dead ends: 281 [2023-11-26 11:51:15,645 INFO L226 Difference]: Without dead ends: 140 [2023-11-26 11:51:15,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-26 11:51:15,654 INFO L413 NwaCegarLoop]: 206 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, 206 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-26 11:51:15,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-26 11:51:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-26 11:51:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-11-26 11:51:15,741 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-11-26 11:51:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:15,741 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-11-26 11:51:15,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-11-26 11:51:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:51:15,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:15,747 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:15,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:51:15,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:15,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:15,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2107692844, now seen corresponding path program 1 times [2023-11-26 11:51:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079551695] [2023-11-26 11:51:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079551695] [2023-11-26 11:51:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079551695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276555380] [2023-11-26 11:51:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:16,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:51:16,177 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:16,276 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-11-26 11:51:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-11-26 11:51:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:16,280 INFO L225 Difference]: With dead ends: 285 [2023-11-26 11:51:16,280 INFO L226 Difference]: Without dead ends: 146 [2023-11-26 11:51:16,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-26 11:51:16,283 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:16,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 610 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-26 11:51:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-11-26 11:51:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-11-26 11:51:16,306 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-11-26 11:51:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:16,307 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-11-26 11:51:16,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-11-26 11:51:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-26 11:51:16,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:16,313 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:16,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:51:16,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:16,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1792907666, now seen corresponding path program 1 times [2023-11-26 11:51:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:16,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303932324] [2023-11-26 11:51:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:16,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303932324] [2023-11-26 11:51:16,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303932324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210283257] [2023-11-26 11:51:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:16,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:16,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:51:16,755 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:16,835 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-11-26 11:51:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-11-26 11:51:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:16,842 INFO L225 Difference]: With dead ends: 321 [2023-11-26 11:51:16,842 INFO L226 Difference]: Without dead ends: 180 [2023-11-26 11:51:16,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-26 11:51:16,851 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:16,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-26 11:51:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-11-26 11:51:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-11-26 11:51:16,882 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-11-26 11:51:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:16,885 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-11-26 11:51:16,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-11-26 11:51:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-26 11:51:16,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:16,895 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:16,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:51:16,896 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:16,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -39285732, now seen corresponding path program 1 times [2023-11-26 11:51:16,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198580244] [2023-11-26 11:51:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:17,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:17,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198580244] [2023-11-26 11:51:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198580244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:51:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686078692] [2023-11-26 11:51:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:17,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:17,064 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:17,105 INFO L93 Difference]: Finished difference Result 363 states and 541 transitions. [2023-11-26 11:51:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-11-26 11:51:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:17,108 INFO L225 Difference]: With dead ends: 363 [2023-11-26 11:51:17,109 INFO L226 Difference]: Without dead ends: 220 [2023-11-26 11:51:17,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:17,111 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 111 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:17,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-26 11:51:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2023-11-26 11:51:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 158 states have internal predecessors, (231), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2023-11-26 11:51:17,124 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 130 [2023-11-26 11:51:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:17,124 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2023-11-26 11:51:17,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2023-11-26 11:51:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-26 11:51:17,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:17,127 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:17,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:51:17,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:17,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1308191411, now seen corresponding path program 1 times [2023-11-26 11:51:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931663179] [2023-11-26 11:51:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:21,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931663179] [2023-11-26 11:51:21,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931663179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:51:21,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180387373] [2023-11-26 11:51:21,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:51:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:21,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:51:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:51:21,150 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:22,320 INFO L93 Difference]: Finished difference Result 479 states and 717 transitions. [2023-11-26 11:51:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:51:22,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2023-11-26 11:51:22,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:22,324 INFO L225 Difference]: With dead ends: 479 [2023-11-26 11:51:22,324 INFO L226 Difference]: Without dead ends: 304 [2023-11-26 11:51:22,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2023-11-26 11:51:22,326 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 787 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:22,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1032 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:51:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-26 11:51:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 234. [2023-11-26 11:51:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 216 states have (on average 1.4722222222222223) internal successors, (318), 216 states have internal predecessors, (318), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 350 transitions. [2023-11-26 11:51:22,353 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 350 transitions. Word has length 130 [2023-11-26 11:51:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:22,353 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 350 transitions. [2023-11-26 11:51:22,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 350 transitions. [2023-11-26 11:51:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-26 11:51:22,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:22,356 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:22,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:51:22,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:22,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash -130787855, now seen corresponding path program 1 times [2023-11-26 11:51:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493582075] [2023-11-26 11:51:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:22,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493582075] [2023-11-26 11:51:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493582075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:22,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434975855] [2023-11-26 11:51:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:22,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:22,643 INFO L87 Difference]: Start difference. First operand 234 states and 350 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:22,741 INFO L93 Difference]: Finished difference Result 553 states and 827 transitions. [2023-11-26 11:51:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:51:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-11-26 11:51:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:22,745 INFO L225 Difference]: With dead ends: 553 [2023-11-26 11:51:22,745 INFO L226 Difference]: Without dead ends: 320 [2023-11-26 11:51:22,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:51:22,749 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 124 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:22,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 900 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-11-26 11:51:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 236. [2023-11-26 11:51:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 218 states have (on average 1.4678899082568808) internal successors, (320), 218 states have internal predecessors, (320), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 352 transitions. [2023-11-26 11:51:22,782 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 352 transitions. Word has length 131 [2023-11-26 11:51:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:22,784 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 352 transitions. [2023-11-26 11:51:22,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 352 transitions. [2023-11-26 11:51:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-26 11:51:22,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:22,787 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:22,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:51:22,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:22,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2126404312, now seen corresponding path program 1 times [2023-11-26 11:51:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:22,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123792325] [2023-11-26 11:51:22,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:22,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:23,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123792325] [2023-11-26 11:51:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123792325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:23,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:23,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905672602] [2023-11-26 11:51:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:23,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:23,064 INFO L87 Difference]: Start difference. First operand 236 states and 352 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:23,152 INFO L93 Difference]: Finished difference Result 496 states and 741 transitions. [2023-11-26 11:51:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:23,153 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-11-26 11:51:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:23,156 INFO L225 Difference]: With dead ends: 496 [2023-11-26 11:51:23,157 INFO L226 Difference]: Without dead ends: 261 [2023-11-26 11:51:23,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-26 11:51:23,160 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 144 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:23,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 765 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-26 11:51:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 239. [2023-11-26 11:51:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 221 states have (on average 1.4615384615384615) internal successors, (323), 221 states have internal predecessors, (323), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 355 transitions. [2023-11-26 11:51:23,186 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 355 transitions. Word has length 132 [2023-11-26 11:51:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:23,187 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 355 transitions. [2023-11-26 11:51:23,187 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 355 transitions. [2023-11-26 11:51:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-26 11:51:23,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:23,190 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:51:23,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:23,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 405809529, now seen corresponding path program 1 times [2023-11-26 11:51:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:23,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261957294] [2023-11-26 11:51:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261957294] [2023-11-26 11:51:24,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261957294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:24,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:24,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:51:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266838188] [2023-11-26 11:51:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:24,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:51:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:51:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:51:24,102 INFO L87 Difference]: Start difference. First operand 239 states and 355 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:24,611 INFO L93 Difference]: Finished difference Result 586 states and 868 transitions. [2023-11-26 11:51:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:51:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-11-26 11:51:24,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:24,615 INFO L225 Difference]: With dead ends: 586 [2023-11-26 11:51:24,615 INFO L226 Difference]: Without dead ends: 348 [2023-11-26 11:51:24,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:24,617 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 449 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:24,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 759 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:51:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-26 11:51:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 239. [2023-11-26 11:51:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 221 states have (on average 1.4570135746606334) internal successors, (322), 221 states have internal predecessors, (322), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 354 transitions. [2023-11-26 11:51:24,644 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 354 transitions. Word has length 132 [2023-11-26 11:51:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:24,645 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 354 transitions. [2023-11-26 11:51:24,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 354 transitions. [2023-11-26 11:51:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-26 11:51:24,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:24,647 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:51:24,648 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:24,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:24,649 INFO L85 PathProgramCache]: Analyzing trace with hash 830641165, now seen corresponding path program 1 times [2023-11-26 11:51:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713626888] [2023-11-26 11:51:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713626888] [2023-11-26 11:51:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713626888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:51:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160253864] [2023-11-26 11:51:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:51:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:51:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:51:25,480 INFO L87 Difference]: Start difference. First operand 239 states and 354 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:25,934 INFO L93 Difference]: Finished difference Result 552 states and 816 transitions. [2023-11-26 11:51:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-11-26 11:51:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:25,938 INFO L225 Difference]: With dead ends: 552 [2023-11-26 11:51:25,938 INFO L226 Difference]: Without dead ends: 314 [2023-11-26 11:51:25,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:51:25,941 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 355 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:25,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 994 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:51:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-26 11:51:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 239. [2023-11-26 11:51:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 221 states have (on average 1.4524886877828054) internal successors, (321), 221 states have internal predecessors, (321), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 353 transitions. [2023-11-26 11:51:25,966 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 353 transitions. Word has length 132 [2023-11-26 11:51:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:25,966 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 353 transitions. [2023-11-26 11:51:25,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 353 transitions. [2023-11-26 11:51:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-26 11:51:25,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:25,969 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:51:25,969 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:25,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:25,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1792724532, now seen corresponding path program 1 times [2023-11-26 11:51:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:25,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735333228] [2023-11-26 11:51:25,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735333228] [2023-11-26 11:51:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735333228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:26,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:26,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:51:26,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685388027] [2023-11-26 11:51:26,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:26,115 INFO L87 Difference]: Start difference. First operand 239 states and 353 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:26,188 INFO L93 Difference]: Finished difference Result 517 states and 758 transitions. [2023-11-26 11:51:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-11-26 11:51:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:26,191 INFO L225 Difference]: With dead ends: 517 [2023-11-26 11:51:26,192 INFO L226 Difference]: Without dead ends: 279 [2023-11-26 11:51:26,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:26,193 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 104 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:26,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 492 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:51:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-26 11:51:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 227. [2023-11-26 11:51:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 209 states have (on average 1.430622009569378) internal successors, (299), 209 states have internal predecessors, (299), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-26 11:51:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 331 transitions. [2023-11-26 11:51:26,216 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 331 transitions. Word has length 133 [2023-11-26 11:51:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:26,217 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 331 transitions. [2023-11-26 11:51:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 331 transitions. [2023-11-26 11:51:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:26,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:26,219 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:26,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:51:26,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:26,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1805969725, now seen corresponding path program 1 times [2023-11-26 11:51:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270085333] [2023-11-26 11:51:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:29,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270085333] [2023-11-26 11:51:29,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270085333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:29,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:29,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:51:29,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259240658] [2023-11-26 11:51:29,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:29,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:51:29,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:51:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:29,005 INFO L87 Difference]: Start difference. First operand 227 states and 331 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:29,735 INFO L93 Difference]: Finished difference Result 660 states and 963 transitions. [2023-11-26 11:51:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:51:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-11-26 11:51:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:29,741 INFO L225 Difference]: With dead ends: 660 [2023-11-26 11:51:29,741 INFO L226 Difference]: Without dead ends: 434 [2023-11-26 11:51:29,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-26 11:51:29,743 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 712 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:29,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 614 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:51:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-26 11:51:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 387. [2023-11-26 11:51:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 364 states have (on average 1.434065934065934) internal successors, (522), 365 states have internal predecessors, (522), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-26 11:51:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 562 transitions. [2023-11-26 11:51:29,777 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 562 transitions. Word has length 134 [2023-11-26 11:51:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:29,778 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 562 transitions. [2023-11-26 11:51:29,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 562 transitions. [2023-11-26 11:51:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:29,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:29,781 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:51:29,782 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:29,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1501950759, now seen corresponding path program 1 times [2023-11-26 11:51:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380447676] [2023-11-26 11:51:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:30,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380447676] [2023-11-26 11:51:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380447676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:30,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:30,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:51:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788515950] [2023-11-26 11:51:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:30,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:30,910 INFO L87 Difference]: Start difference. First operand 387 states and 562 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:31,147 INFO L93 Difference]: Finished difference Result 856 states and 1243 transitions. [2023-11-26 11:51:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:51:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-11-26 11:51:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:31,154 INFO L225 Difference]: With dead ends: 856 [2023-11-26 11:51:31,154 INFO L226 Difference]: Without dead ends: 470 [2023-11-26 11:51:31,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:51:31,156 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 90 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:31,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 471 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:51:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-26 11:51:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 460. [2023-11-26 11:51:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 419 states have (on average 1.4128878281622912) internal successors, (592), 420 states have internal predecessors, (592), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:51:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 664 transitions. [2023-11-26 11:51:31,211 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 664 transitions. Word has length 134 [2023-11-26 11:51:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:31,212 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 664 transitions. [2023-11-26 11:51:31,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 664 transitions. [2023-11-26 11:51:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:31,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:31,215 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:31,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:51:31,215 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:31,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1041523795, now seen corresponding path program 1 times [2023-11-26 11:51:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595299391] [2023-11-26 11:51:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595299391] [2023-11-26 11:51:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595299391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:34,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-26 11:51:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622823358] [2023-11-26 11:51:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:34,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 11:51:34,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:51:34,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:51:34,640 INFO L87 Difference]: Start difference. First operand 460 states and 664 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:36,984 INFO L93 Difference]: Finished difference Result 1098 states and 1589 transitions. [2023-11-26 11:51:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-26 11:51:36,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-11-26 11:51:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:36,990 INFO L225 Difference]: With dead ends: 1098 [2023-11-26 11:51:36,990 INFO L226 Difference]: Without dead ends: 712 [2023-11-26 11:51:36,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2023-11-26 11:51:36,992 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 1064 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:36,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 2010 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 11:51:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2023-11-26 11:51:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 570. [2023-11-26 11:51:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 529 states have (on average 1.4215500945179584) internal successors, (752), 530 states have internal predecessors, (752), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:51:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 824 transitions. [2023-11-26 11:51:37,048 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 824 transitions. Word has length 134 [2023-11-26 11:51:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:37,049 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 824 transitions. [2023-11-26 11:51:37,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 824 transitions. [2023-11-26 11:51:37,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:37,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:37,052 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:37,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:51:37,052 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:37,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 648496785, now seen corresponding path program 1 times [2023-11-26 11:51:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911321682] [2023-11-26 11:51:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:37,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911321682] [2023-11-26 11:51:37,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911321682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:37,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:37,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:51:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803241235] [2023-11-26 11:51:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:37,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:51:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:37,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:51:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:51:37,632 INFO L87 Difference]: Start difference. First operand 570 states and 824 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:38,065 INFO L93 Difference]: Finished difference Result 1208 states and 1747 transitions. [2023-11-26 11:51:38,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:51:38,066 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:51:38,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:38,072 INFO L225 Difference]: With dead ends: 1208 [2023-11-26 11:51:38,072 INFO L226 Difference]: Without dead ends: 712 [2023-11-26 11:51:38,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:51:38,074 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 404 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:38,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 905 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:51:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2023-11-26 11:51:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 570. [2023-11-26 11:51:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 529 states have (on average 1.4177693761814745) internal successors, (750), 530 states have internal predecessors, (750), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:51:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 822 transitions. [2023-11-26 11:51:38,164 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 822 transitions. Word has length 134 [2023-11-26 11:51:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:38,165 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 822 transitions. [2023-11-26 11:51:38,165 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 822 transitions. [2023-11-26 11:51:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:38,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:38,169 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:51:38,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:38,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -647419947, now seen corresponding path program 1 times [2023-11-26 11:51:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389822209] [2023-11-26 11:51:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389822209] [2023-11-26 11:51:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389822209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:51:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665560940] [2023-11-26 11:51:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:38,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:51:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:51:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:51:38,745 INFO L87 Difference]: Start difference. First operand 570 states and 822 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:39,157 INFO L93 Difference]: Finished difference Result 1133 states and 1637 transitions. [2023-11-26 11:51:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:51:39,158 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-11-26 11:51:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:39,162 INFO L225 Difference]: With dead ends: 1133 [2023-11-26 11:51:39,162 INFO L226 Difference]: Without dead ends: 637 [2023-11-26 11:51:39,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:39,164 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 293 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:39,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 906 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:51:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2023-11-26 11:51:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 570. [2023-11-26 11:51:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 529 states have (on average 1.4139886578449905) internal successors, (748), 530 states have internal predecessors, (748), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:51:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 820 transitions. [2023-11-26 11:51:39,233 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 820 transitions. Word has length 134 [2023-11-26 11:51:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:39,234 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 820 transitions. [2023-11-26 11:51:39,234 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-26 11:51:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 820 transitions. [2023-11-26 11:51:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-26 11:51:39,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:39,238 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:51:39,238 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:39,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1040446957, now seen corresponding path program 1 times [2023-11-26 11:51:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479282101] [2023-11-26 11:51:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:42,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479282101] [2023-11-26 11:51:42,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479282101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:42,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:42,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-26 11:51:42,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504406953] [2023-11-26 11:51:42,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:42,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 11:51:42,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:42,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:51:42,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:51:42,750 INFO L87 Difference]: Start difference. First operand 570 states and 820 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:44,787 INFO L93 Difference]: Finished difference Result 1131 states and 1630 transitions. [2023-11-26 11:51:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 11:51:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2023-11-26 11:51:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:44,792 INFO L225 Difference]: With dead ends: 1131 [2023-11-26 11:51:44,793 INFO L226 Difference]: Without dead ends: 635 [2023-11-26 11:51:44,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2023-11-26 11:51:44,795 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 806 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:44,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2005 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 11:51:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-26 11:51:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 560. [2023-11-26 11:51:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 519 states have (on average 1.416184971098266) internal successors, (735), 520 states have internal predecessors, (735), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-26 11:51:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 807 transitions. [2023-11-26 11:51:44,846 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 807 transitions. Word has length 134 [2023-11-26 11:51:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:44,846 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 807 transitions. [2023-11-26 11:51:44,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-26 11:51:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 807 transitions. [2023-11-26 11:51:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-26 11:51:44,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:44,849 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:51:44,850 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:44,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1463793711, now seen corresponding path program 1 times [2023-11-26 11:51:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43175251] [2023-11-26 11:51:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43175251] [2023-11-26 11:51:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43175251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-26 11:51:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670767884] [2023-11-26 11:51:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:47,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 11:51:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:47,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:51:47,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:51:47,533 INFO L87 Difference]: Start difference. First operand 560 states and 807 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-26 11:51:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:51:49,507 INFO L93 Difference]: Finished difference Result 1226 states and 1773 transitions. [2023-11-26 11:51:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-26 11:51:49,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2023-11-26 11:51:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:51:49,513 INFO L225 Difference]: With dead ends: 1226 [2023-11-26 11:51:49,513 INFO L226 Difference]: Without dead ends: 740 [2023-11-26 11:51:49,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2023-11-26 11:51:49,515 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 1304 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:51:49,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1423 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 11:51:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-11-26 11:51:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 662. [2023-11-26 11:51:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 618 states have (on average 1.419093851132686) internal successors, (877), 620 states have internal predecessors, (877), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-26 11:51:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 953 transitions. [2023-11-26 11:51:49,595 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 953 transitions. Word has length 135 [2023-11-26 11:51:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:51:49,595 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 953 transitions. [2023-11-26 11:51:49,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-26 11:51:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 953 transitions. [2023-11-26 11:51:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-26 11:51:49,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:51:49,598 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 11:51:49,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:51:49,599 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:51:49,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1159774745, now seen corresponding path program 1 times [2023-11-26 11:51:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:51:49,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131547016] [2023-11-26 11:51:49,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:51:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:51:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:51:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-26 11:51:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:51:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-26 11:51:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:51:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-26 11:51:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-26 11:51:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-26 11:51:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:51:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:51:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:51:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-26 11:51:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-26 11:51:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:51:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-26 11:51:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:51:52,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:51:52,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131547016] [2023-11-26 11:51:52,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131547016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:52,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:52,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-26 11:51:52,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407843158] [2023-11-26 11:51:52,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:52,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 11:51:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:51:52,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 11:51:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:51:52,619 INFO L87 Difference]: Start difference. First operand 662 states and 953 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16)