./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu --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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:55:31,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:55:31,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:55:31,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:55:31,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:55:31,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:55:31,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:55:31,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:55:31,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:55:31,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:55:31,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:55:31,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:55:31,664 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:55:31,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:55:31,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:55:31,667 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:55:31,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:55:31,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:55:31,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:55:31,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:55:31,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:55:31,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:55:31,670 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:55:31,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:55:31,671 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:55:31,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:55:31,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:55:31,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:55:31,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:31,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:55:31,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:55:31,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:55:31,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:55:31,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:55:31,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:55:31,676 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:55:31,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:55:31,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:55:31,676 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:55:31,676 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_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/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_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu 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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2023-11-19 07:55:31,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:55:32,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:55:32,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:55:32,040 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:55:32,040 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:55:32,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2023-11-19 07:55:35,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:55:35,448 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:55:35,448 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2023-11-19 07:55:35,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/data/98dc258fd/2719b62eea2f4209a2aef172a80a7fa1/FLAG04a341509 [2023-11-19 07:55:35,500 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/data/98dc258fd/2719b62eea2f4209a2aef172a80a7fa1 [2023-11-19 07:55:35,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:55:35,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:55:35,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:35,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:55:35,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:55:35,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa90c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35, skipping insertion in model container [2023-11-19 07:55:35,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,565 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:55:35,728 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_36442402-9a69-4ce2-be53-50157e78f1d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2023-11-19 07:55:35,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:35,813 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:55:35,827 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_36442402-9a69-4ce2-be53-50157e78f1d2/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2023-11-19 07:55:35,872 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:35,893 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:55:35,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35 WrapperNode [2023-11-19 07:55:35,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:35,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:35,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:55:35,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:55:35,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,976 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 532 [2023-11-19 07:55:35,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:35,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:55:35,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:55:35,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:55:35,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:35,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:55:36,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:55:36,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:55:36,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:55:36,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (1/1) ... [2023-11-19 07:55:36,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:36,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:55:36,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36442402-9a69-4ce2-be53-50157e78f1d2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:55:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:55:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:55:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:55:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:55:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:55:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:55:36,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:55:36,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:55:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:55:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:55:36,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:55:36,371 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:55:36,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:55:37,147 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:55:37,164 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:55:37,164 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:55:37,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:37 BoogieIcfgContainer [2023-11-19 07:55:37,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:55:37,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:55:37,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:55:37,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:55:37,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:55:35" (1/3) ... [2023-11-19 07:55:37,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318e35c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:37, skipping insertion in model container [2023-11-19 07:55:37,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:35" (2/3) ... [2023-11-19 07:55:37,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318e35c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:37, skipping insertion in model container [2023-11-19 07:55:37,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:37" (3/3) ... [2023-11-19 07:55:37,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2023-11-19 07:55:37,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:55:37,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:55:37,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:55:37,272 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;@7e8f0b0d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:55:37,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:55:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-19 07:55:37,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:37,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:37,296 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:37,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:37,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1040917824, now seen corresponding path program 1 times [2023-11-19 07:55:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343546209] [2023-11-19 07:55:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343546209] [2023-11-19 07:55:38,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343546209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:38,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:38,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:38,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864000036] [2023-11-19 07:55:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:38,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:55:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:55:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:55:38,074 INFO L87 Difference]: Start difference. First operand has 122 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:55:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:38,131 INFO L93 Difference]: Finished difference Result 237 states and 379 transitions. [2023-11-19 07:55:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:55:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2023-11-19 07:55:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:38,150 INFO L225 Difference]: With dead ends: 237 [2023-11-19 07:55:38,151 INFO L226 Difference]: Without dead ends: 118 [2023-11-19 07:55:38,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:55:38,162 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:38,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-19 07:55:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-19 07:55:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-19 07:55:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2023-11-19 07:55:38,236 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 151 [2023-11-19 07:55:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:38,237 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2023-11-19 07:55:38,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:55:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2023-11-19 07:55:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:38,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:38,243 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:55:38,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:38,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 13191086, now seen corresponding path program 1 times [2023-11-19 07:55:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454220102] [2023-11-19 07:55:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:38,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:38,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454220102] [2023-11-19 07:55:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454220102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:55:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742159796] [2023-11-19 07:55:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:38,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:38,801 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:55:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:38,855 INFO L93 Difference]: Finished difference Result 239 states and 358 transitions. [2023-11-19 07:55:38,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:55:38,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2023-11-19 07:55:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:38,859 INFO L225 Difference]: With dead ends: 239 [2023-11-19 07:55:38,860 INFO L226 Difference]: Without dead ends: 124 [2023-11-19 07:55:38,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:55:38,863 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 10 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:38,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 513 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-19 07:55:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-11-19 07:55:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 99 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-19 07:55:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2023-11-19 07:55:38,884 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 151 [2023-11-19 07:55:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:38,885 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2023-11-19 07:55:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-19 07:55:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2023-11-19 07:55:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:38,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:38,889 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:38,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:55:38,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:38,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -666081168, now seen corresponding path program 1 times [2023-11-19 07:55:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821975752] [2023-11-19 07:55:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821975752] [2023-11-19 07:55:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821975752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:39,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:39,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748030418] [2023-11-19 07:55:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:39,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:39,142 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:39,212 INFO L93 Difference]: Finished difference Result 238 states and 355 transitions. [2023-11-19 07:55:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:39,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-19 07:55:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:39,216 INFO L225 Difference]: With dead ends: 238 [2023-11-19 07:55:39,219 INFO L226 Difference]: Without dead ends: 121 [2023-11-19 07:55:39,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 07:55:39,223 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:39,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-19 07:55:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-19 07:55:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-19 07:55:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2023-11-19 07:55:39,244 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 151 [2023-11-19 07:55:39,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:39,245 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2023-11-19 07:55:39,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2023-11-19 07:55:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:39,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:39,250 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:39,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:55:39,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:39,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash -156608078, now seen corresponding path program 1 times [2023-11-19 07:55:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232771346] [2023-11-19 07:55:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232771346] [2023-11-19 07:55:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232771346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906333449] [2023-11-19 07:55:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:39,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:39,496 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:39,520 INFO L93 Difference]: Finished difference Result 240 states and 357 transitions. [2023-11-19 07:55:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-19 07:55:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:39,527 INFO L225 Difference]: With dead ends: 240 [2023-11-19 07:55:39,527 INFO L226 Difference]: Without dead ends: 122 [2023-11-19 07:55:39,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 07:55:39,539 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:39,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-19 07:55:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-19 07:55:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-19 07:55:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2023-11-19 07:55:39,565 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2023-11-19 07:55:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2023-11-19 07:55:39,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2023-11-19 07:55:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:39,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:39,575 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:39,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:55:39,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:39,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash -974256528, now seen corresponding path program 1 times [2023-11-19 07:55:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459635156] [2023-11-19 07:55:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459635156] [2023-11-19 07:55:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459635156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-19 07:55:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449747816] [2023-11-19 07:55:42,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:42,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 07:55:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:55:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:55:42,581 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:44,545 INFO L93 Difference]: Finished difference Result 518 states and 774 transitions. [2023-11-19 07:55:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 07:55:44,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-19 07:55:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:44,549 INFO L225 Difference]: With dead ends: 518 [2023-11-19 07:55:44,549 INFO L226 Difference]: Without dead ends: 399 [2023-11-19 07:55:44,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2023-11-19 07:55:44,552 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 897 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:44,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1421 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:55:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-19 07:55:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 201. [2023-11-19 07:55:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.3875) internal successors, (222), 160 states have internal predecessors, (222), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 298 transitions. [2023-11-19 07:55:44,583 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 298 transitions. Word has length 151 [2023-11-19 07:55:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:44,584 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 298 transitions. [2023-11-19 07:55:44,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 298 transitions. [2023-11-19 07:55:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-19 07:55:44,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:44,587 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:44,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:55:44,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:44,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2040847090, now seen corresponding path program 1 times [2023-11-19 07:55:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:44,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133630075] [2023-11-19 07:55:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:44,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:44,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133630075] [2023-11-19 07:55:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133630075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986176353] [2023-11-19 07:55:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:44,784 INFO L87 Difference]: Start difference. First operand 201 states and 298 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:44,820 INFO L93 Difference]: Finished difference Result 345 states and 514 transitions. [2023-11-19 07:55:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2023-11-19 07:55:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:44,824 INFO L225 Difference]: With dead ends: 345 [2023-11-19 07:55:44,824 INFO L226 Difference]: Without dead ends: 226 [2023-11-19 07:55:44,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 07:55:44,825 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 42 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:44,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 370 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-19 07:55:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 202. [2023-11-19 07:55:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 161 states have internal predecessors, (223), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2023-11-19 07:55:44,847 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 151 [2023-11-19 07:55:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:44,848 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2023-11-19 07:55:44,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2023-11-19 07:55:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 07:55:44,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:44,851 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:44,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:55:44,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:44,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1874858234, now seen corresponding path program 1 times [2023-11-19 07:55:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:44,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440068294] [2023-11-19 07:55:44,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:45,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:45,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440068294] [2023-11-19 07:55:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440068294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:45,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:55:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211760181] [2023-11-19 07:55:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:45,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:55:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:55:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:55:45,652 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:46,292 INFO L93 Difference]: Finished difference Result 405 states and 603 transitions. [2023-11-19 07:55:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:55:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2023-11-19 07:55:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:46,296 INFO L225 Difference]: With dead ends: 405 [2023-11-19 07:55:46,296 INFO L226 Difference]: Without dead ends: 285 [2023-11-19 07:55:46,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:55:46,298 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 307 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:46,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 550 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:55:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-19 07:55:46,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 222. [2023-11-19 07:55:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 181 states have (on average 1.408839779005525) internal successors, (255), 181 states have internal predecessors, (255), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 331 transitions. [2023-11-19 07:55:46,325 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 331 transitions. Word has length 152 [2023-11-19 07:55:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:46,326 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 331 transitions. [2023-11-19 07:55:46,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 331 transitions. [2023-11-19 07:55:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 07:55:46,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:46,329 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:46,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:55:46,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:46,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1283637910, now seen corresponding path program 1 times [2023-11-19 07:55:46,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:46,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461615884] [2023-11-19 07:55:46,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:46,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:46,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461615884] [2023-11-19 07:55:46,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461615884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:46,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526070805] [2023-11-19 07:55:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:46,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:46,555 INFO L87 Difference]: Start difference. First operand 222 states and 331 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:46,610 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2023-11-19 07:55:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2023-11-19 07:55:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:46,616 INFO L225 Difference]: With dead ends: 386 [2023-11-19 07:55:46,616 INFO L226 Difference]: Without dead ends: 246 [2023-11-19 07:55:46,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 07:55:46,618 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 45 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:46,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-11-19 07:55:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 222. [2023-11-19 07:55:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 181 states have internal predecessors, (253), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 329 transitions. [2023-11-19 07:55:46,649 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 329 transitions. Word has length 152 [2023-11-19 07:55:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:46,650 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 329 transitions. [2023-11-19 07:55:46,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 329 transitions. [2023-11-19 07:55:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 07:55:46,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:46,653 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:46,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:55:46,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:46,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1990261032, now seen corresponding path program 1 times [2023-11-19 07:55:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217989914] [2023-11-19 07:55:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217989914] [2023-11-19 07:55:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217989914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:55:47,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350789951] [2023-11-19 07:55:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:47,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:55:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:55:47,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:55:47,414 INFO L87 Difference]: Start difference. First operand 222 states and 329 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:48,211 INFO L93 Difference]: Finished difference Result 424 states and 630 transitions. [2023-11-19 07:55:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:55:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2023-11-19 07:55:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:48,215 INFO L225 Difference]: With dead ends: 424 [2023-11-19 07:55:48,215 INFO L226 Difference]: Without dead ends: 284 [2023-11-19 07:55:48,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:55:48,216 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 293 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:48,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 522 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:55:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-19 07:55:48,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 224. [2023-11-19 07:55:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 183 states have (on average 1.3879781420765027) internal successors, (254), 183 states have internal predecessors, (254), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2023-11-19 07:55:48,244 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 152 [2023-11-19 07:55:48,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:48,245 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2023-11-19 07:55:48,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2023-11-19 07:55:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-19 07:55:48,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:48,248 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:48,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:55:48,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:48,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash 488654840, now seen corresponding path program 1 times [2023-11-19 07:55:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313183684] [2023-11-19 07:55:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313183684] [2023-11-19 07:55:48,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313183684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:48,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:48,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087904619] [2023-11-19 07:55:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:48,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:48,417 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:48,453 INFO L93 Difference]: Finished difference Result 362 states and 535 transitions. [2023-11-19 07:55:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2023-11-19 07:55:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:48,456 INFO L225 Difference]: With dead ends: 362 [2023-11-19 07:55:48,456 INFO L226 Difference]: Without dead ends: 220 [2023-11-19 07:55:48,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-19 07:55:48,458 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:48,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:55:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-19 07:55:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-11-19 07:55:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 179 states have (on average 1.3743016759776536) internal successors, (246), 179 states have internal predecessors, (246), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 322 transitions. [2023-11-19 07:55:48,479 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 322 transitions. Word has length 152 [2023-11-19 07:55:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:48,480 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 322 transitions. [2023-11-19 07:55:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 322 transitions. [2023-11-19 07:55:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:55:48,482 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:48,483 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:48,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:55:48,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:48,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash 118505438, now seen corresponding path program 1 times [2023-11-19 07:55:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743354103] [2023-11-19 07:55:48,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:51,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:51,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743354103] [2023-11-19 07:55:51,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743354103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:51,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:51,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-19 07:55:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53791543] [2023-11-19 07:55:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:51,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 07:55:51,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 07:55:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:55:51,526 INFO L87 Difference]: Start difference. First operand 220 states and 322 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:54,309 INFO L93 Difference]: Finished difference Result 466 states and 687 transitions. [2023-11-19 07:55:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:55:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-19 07:55:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:54,313 INFO L225 Difference]: With dead ends: 466 [2023-11-19 07:55:54,313 INFO L226 Difference]: Without dead ends: 328 [2023-11-19 07:55:54,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2023-11-19 07:55:54,315 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 551 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:54,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1296 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-19 07:55:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-19 07:55:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 244. [2023-11-19 07:55:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 203 states have (on average 1.3940886699507389) internal successors, (283), 203 states have internal predecessors, (283), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 359 transitions. [2023-11-19 07:55:54,351 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 359 transitions. Word has length 153 [2023-11-19 07:55:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:54,351 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 359 transitions. [2023-11-19 07:55:54,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:55:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 359 transitions. [2023-11-19 07:55:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:55:54,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:54,354 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:54,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:55:54,355 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:54,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 376670876, now seen corresponding path program 1 times [2023-11-19 07:55:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:54,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200607429] [2023-11-19 07:55:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:55:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:55:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:55:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:55:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:55:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:55:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:55:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:55:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:55:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:55:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:55:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:55:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:55:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:55:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:55:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:55:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:55:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:55:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:55:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:55:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200607429] [2023-11-19 07:55:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200607429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-19 07:55:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036701035] [2023-11-19 07:55:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:57,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 07:55:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 07:55:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:55:57,466 INFO L87 Difference]: Start difference. First operand 244 states and 359 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-19 07:55:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:55:59,099 INFO L93 Difference]: Finished difference Result 463 states and 682 transitions. [2023-11-19 07:55:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:55:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 153 [2023-11-19 07:55:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:55:59,106 INFO L225 Difference]: With dead ends: 463 [2023-11-19 07:55:59,107 INFO L226 Difference]: Without dead ends: 299 [2023-11-19 07:55:59,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:55:59,108 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 302 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:55:59,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 547 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:55:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-19 07:55:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 265. [2023-11-19 07:55:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.4017857142857142) internal successors, (314), 224 states have internal predecessors, (314), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:55:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 390 transitions. [2023-11-19 07:55:59,163 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 390 transitions. Word has length 153 [2023-11-19 07:55:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:55:59,164 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 390 transitions. [2023-11-19 07:55:59,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-19 07:55:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 390 transitions. [2023-11-19 07:55:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:55:59,167 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:55:59,167 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:55:59,168 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:55:59,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:59,169 INFO L85 PathProgramCache]: Analyzing trace with hash -892611812, now seen corresponding path program 1 times [2023-11-19 07:55:59,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:59,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907750934] [2023-11-19 07:55:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:56:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:56:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:56:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:56:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:56:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:56:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:56:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:56:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:56:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:56:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:56:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:56:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:56:00,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:00,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907750934] [2023-11-19 07:56:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907750934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:00,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:00,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:56:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24079839] [2023-11-19 07:56:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:00,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:56:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:56:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:56:00,859 INFO L87 Difference]: Start difference. First operand 265 states and 390 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:01,898 INFO L93 Difference]: Finished difference Result 534 states and 787 transitions. [2023-11-19 07:56:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:56:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-19 07:56:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:01,903 INFO L225 Difference]: With dead ends: 534 [2023-11-19 07:56:01,903 INFO L226 Difference]: Without dead ends: 349 [2023-11-19 07:56:01,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:56:01,905 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 308 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:01,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 561 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:56:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-19 07:56:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 284. [2023-11-19 07:56:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 243 states have (on average 1.4074074074074074) internal successors, (342), 243 states have internal predecessors, (342), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:56:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 418 transitions. [2023-11-19 07:56:01,962 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 418 transitions. Word has length 153 [2023-11-19 07:56:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:01,966 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 418 transitions. [2023-11-19 07:56:01,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 418 transitions. [2023-11-19 07:56:01,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:56:01,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:01,970 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:01,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:56:01,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:01,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash 180545052, now seen corresponding path program 1 times [2023-11-19 07:56:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660515354] [2023-11-19 07:56:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:01,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:56:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:56:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:56:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:56:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:56:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:56:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:56:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:56:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:56:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:56:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:56:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:56:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:56:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660515354] [2023-11-19 07:56:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660515354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:04,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:04,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-19 07:56:04,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701161104] [2023-11-19 07:56:04,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:04,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 07:56:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:56:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:56:04,828 INFO L87 Difference]: Start difference. First operand 284 states and 418 transitions. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-19 07:56:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:06,378 INFO L93 Difference]: Finished difference Result 549 states and 809 transitions. [2023-11-19 07:56:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:56:06,379 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 153 [2023-11-19 07:56:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:06,382 INFO L225 Difference]: With dead ends: 549 [2023-11-19 07:56:06,382 INFO L226 Difference]: Without dead ends: 345 [2023-11-19 07:56:06,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:56:06,384 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 701 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:06,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 569 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:56:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-19 07:56:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 288. [2023-11-19 07:56:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 247 states have (on average 1.4048582995951417) internal successors, (347), 247 states have internal predecessors, (347), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:56:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2023-11-19 07:56:06,429 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 153 [2023-11-19 07:56:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:06,429 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2023-11-19 07:56:06,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 8 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2023-11-19 07:56:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2023-11-19 07:56:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:56:06,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:06,432 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:06,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:56:06,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:06,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash 438710490, now seen corresponding path program 1 times [2023-11-19 07:56:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:06,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416760701] [2023-11-19 07:56:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:56:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:56:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:56:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:56:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:56:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:56:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:56:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:56:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:56:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:56:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:56:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:56:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:56:08,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416760701] [2023-11-19 07:56:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416760701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:08,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-19 07:56:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244196933] [2023-11-19 07:56:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:08,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 07:56:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:56:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:56:08,782 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:11,534 INFO L93 Difference]: Finished difference Result 530 states and 777 transitions. [2023-11-19 07:56:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:56:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-19 07:56:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:11,538 INFO L225 Difference]: With dead ends: 530 [2023-11-19 07:56:11,539 INFO L226 Difference]: Without dead ends: 322 [2023-11-19 07:56:11,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2023-11-19 07:56:11,541 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 415 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:11,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1158 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-19 07:56:11,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-19 07:56:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 290. [2023-11-19 07:56:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.4016064257028114) internal successors, (349), 249 states have internal predecessors, (349), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:56:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 425 transitions. [2023-11-19 07:56:11,592 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 425 transitions. Word has length 153 [2023-11-19 07:56:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:11,593 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 425 transitions. [2023-11-19 07:56:11,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 425 transitions. [2023-11-19 07:56:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:56:11,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:11,597 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:11,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:56:11,598 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:11,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -390967652, now seen corresponding path program 1 times [2023-11-19 07:56:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:11,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812356440] [2023-11-19 07:56:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:56:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:56:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:56:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:56:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:56:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:56:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:56:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:56:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:56:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:56:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:56:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:56:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:56:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:56:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:56:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:56:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:56:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:56:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:56:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-11-19 07:56:13,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812356440] [2023-11-19 07:56:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812356440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:56:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518398167] [2023-11-19 07:56:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:13,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:56:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:56:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:56:13,278 INFO L87 Difference]: Start difference. First operand 290 states and 425 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:56:14,293 INFO L93 Difference]: Finished difference Result 559 states and 820 transitions. [2023-11-19 07:56:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:56:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2023-11-19 07:56:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:56:14,298 INFO L225 Difference]: With dead ends: 559 [2023-11-19 07:56:14,298 INFO L226 Difference]: Without dead ends: 349 [2023-11-19 07:56:14,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:56:14,300 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 351 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:56:14,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 523 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:56:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-19 07:56:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 290. [2023-11-19 07:56:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.393574297188755) internal successors, (347), 249 states have internal predecessors, (347), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 07:56:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 423 transitions. [2023-11-19 07:56:14,353 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 423 transitions. Word has length 153 [2023-11-19 07:56:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:56:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 423 transitions. [2023-11-19 07:56:14,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-11-19 07:56:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 423 transitions. [2023-11-19 07:56:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-19 07:56:14,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:56:14,357 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:14,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:56:14,358 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:56:14,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1402084902, now seen corresponding path program 1 times [2023-11-19 07:56:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932603021] [2023-11-19 07:56:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat