./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/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_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/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_29aee206-d783-47a5-9953-6810ee27043a/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 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:14,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:14,999 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:40:15,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:15,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:15,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:15,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:15,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:15,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:40:15,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:40:15,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:15,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:15,036 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:15,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:15,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:40:15,038 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:15,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:40:15,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:15,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:15,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:40:15,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:40:15,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:40:15,042 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:15,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:40:15,043 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:15,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:15,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:15,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:40:15,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:15,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:15,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:40:15,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:40:15,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:40:15,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:40:15,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:40:15,049 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:40:15,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:40:15,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:40:15,050 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:40:15,050 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_29aee206-d783-47a5-9953-6810ee27043a/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_29aee206-d783-47a5-9953-6810ee27043a/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 -> 21018b8dbfba8116b3b0bab68e9887f4757cf1a4556541f23f42e4d95555f99e [2023-11-19 07:40:15,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:15,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:15,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:15,414 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:15,414 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:15,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-19 07:40:18,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:18,958 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:18,959 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-19 07:40:18,970 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/data/cdcbf93e7/63a734ce614143708ec014ea7a44d27a/FLAG0888126fa [2023-11-19 07:40:19,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/data/cdcbf93e7/63a734ce614143708ec014ea7a44d27a [2023-11-19 07:40:19,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:19,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:19,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:19,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:19,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:19,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbfa468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19, skipping insertion in model container [2023-11-19 07:40:19,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,281 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:19,467 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_29aee206-d783-47a5-9953-6810ee27043a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2023-11-19 07:40:19,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:19,587 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:19,599 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_29aee206-d783-47a5-9953-6810ee27043a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-70.i[917,930] [2023-11-19 07:40:19,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:19,659 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:19,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19 WrapperNode [2023-11-19 07:40:19,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:19,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:19,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:19,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:19,683 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:40:19" (1/1) ... [2023-11-19 07:40:19,717 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:40:19" (1/1) ... [2023-11-19 07:40:19,781 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2023-11-19 07:40:19,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:19,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:19,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:19,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:19,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,847 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:19,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:19,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:19,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:19,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (1/1) ... [2023-11-19 07:40:19,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:40:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:19,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/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:40:19,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29aee206-d783-47a5-9953-6810ee27043a/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:40:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:40:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:40:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:40:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:40:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:40:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:40:19,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:40:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:40:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:19,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:20,113 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:20,120 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:20,832 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:20,846 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:20,846 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:40:20,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:20 BoogieIcfgContainer [2023-11-19 07:40:20,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:20,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:40:20,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:40:20,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:40:20,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:19" (1/3) ... [2023-11-19 07:40:20,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757da0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:20, skipping insertion in model container [2023-11-19 07:40:20,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:19" (2/3) ... [2023-11-19 07:40:20,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757da0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:40:20, skipping insertion in model container [2023-11-19 07:40:20,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:20" (3/3) ... [2023-11-19 07:40:20,887 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-70.i [2023-11-19 07:40:20,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:40:20,907 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:40:20,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:40:20,992 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;@441a1da0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:40:20,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:40:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:40:21,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:21,026 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:21,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:21,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 106270662, now seen corresponding path program 1 times [2023-11-19 07:40:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034911418] [2023-11-19 07:40:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034911418] [2023-11-19 07:40:21,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034911418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:21,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:40:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940601729] [2023-11-19 07:40:21,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:21,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:40:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:40:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:40:21,574 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:40:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:21,612 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2023-11-19 07:40:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:40:21,615 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-11-19 07:40:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:21,624 INFO L225 Difference]: With dead ends: 207 [2023-11-19 07:40:21,625 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:40:21,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:40:21,633 INFO L413 NwaCegarLoop]: 151 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, 151 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:40:21,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:40:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-11-19 07:40:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-11-19 07:40:21,690 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 116 [2023-11-19 07:40:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:21,690 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-11-19 07:40:21,690 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 07:40:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-11-19 07:40:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:40:21,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:21,694 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:21,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:40:21,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:21,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2089856086, now seen corresponding path program 1 times [2023-11-19 07:40:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048328544] [2023-11-19 07:40:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048328544] [2023-11-19 07:40:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048328544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942224652] [2023-11-19 07:40:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:22,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:22,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:22,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:22,312 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:22,414 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2023-11-19 07:40:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:40:22,418 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-19 07:40:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:22,421 INFO L225 Difference]: With dead ends: 227 [2023-11-19 07:40:22,422 INFO L226 Difference]: Without dead ends: 127 [2023-11-19 07:40:22,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:40:22,427 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 44 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:22,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-19 07:40:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2023-11-19 07:40:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-11-19 07:40:22,455 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 116 [2023-11-19 07:40:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:22,459 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-11-19 07:40:22,461 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), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-11-19 07:40:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:40:22,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:22,467 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:40:22,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:22,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1126398447, now seen corresponding path program 1 times [2023-11-19 07:40:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752260873] [2023-11-19 07:40:22,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:22,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752260873] [2023-11-19 07:40:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752260873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370645749] [2023-11-19 07:40:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:22,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:22,828 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:22,893 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2023-11-19 07:40:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:40:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-19 07:40:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:22,900 INFO L225 Difference]: With dead ends: 215 [2023-11-19 07:40:22,900 INFO L226 Difference]: Without dead ends: 113 [2023-11-19 07:40:22,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:40:22,910 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:22,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-19 07:40:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-11-19 07:40:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-11-19 07:40:22,923 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 118 [2023-11-19 07:40:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:22,924 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-11-19 07:40:22,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-11-19 07:40:22,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:40:22,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:22,927 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:40:22,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:22,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash 648608915, now seen corresponding path program 1 times [2023-11-19 07:40:22,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:22,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172489901] [2023-11-19 07:40:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172489901] [2023-11-19 07:40:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172489901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229164457] [2023-11-19 07:40:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:23,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:23,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:23,351 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:23,528 INFO L93 Difference]: Finished difference Result 225 states and 329 transitions. [2023-11-19 07:40:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-19 07:40:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:23,532 INFO L225 Difference]: With dead ends: 225 [2023-11-19 07:40:23,533 INFO L226 Difference]: Without dead ends: 121 [2023-11-19 07:40:23,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:40:23,535 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 18 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:23,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 470 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:40:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-19 07:40:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2023-11-19 07:40:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-11-19 07:40:23,547 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 118 [2023-11-19 07:40:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:23,548 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-11-19 07:40:23,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-11-19 07:40:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:40:23,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:23,551 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:23,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:40:23,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:23,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 851197139, now seen corresponding path program 1 times [2023-11-19 07:40:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:23,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105115612] [2023-11-19 07:40:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:24,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105115612] [2023-11-19 07:40:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105115612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:40:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326168146] [2023-11-19 07:40:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:24,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:40:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:40:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:40:24,331 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:24,982 INFO L93 Difference]: Finished difference Result 287 states and 414 transitions. [2023-11-19 07:40:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:40:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-11-19 07:40:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:24,985 INFO L225 Difference]: With dead ends: 287 [2023-11-19 07:40:24,985 INFO L226 Difference]: Without dead ends: 180 [2023-11-19 07:40:24,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:40:24,987 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 351 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:24,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:40:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-19 07:40:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2023-11-19 07:40:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2023-11-19 07:40:25,011 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 118 [2023-11-19 07:40:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:25,012 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2023-11-19 07:40:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2023-11-19 07:40:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:40:25,020 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:25,020 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:40:25,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:25,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1881418347, now seen corresponding path program 1 times [2023-11-19 07:40:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587581752] [2023-11-19 07:40:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:25,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587581752] [2023-11-19 07:40:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587581752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:25,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875629033] [2023-11-19 07:40:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:25,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:25,591 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:25,848 INFO L93 Difference]: Finished difference Result 297 states and 428 transitions. [2023-11-19 07:40:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:40:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-19 07:40:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:25,852 INFO L225 Difference]: With dead ends: 297 [2023-11-19 07:40:25,852 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 07:40:25,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:40:25,856 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:25,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 455 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:40:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 07:40:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 125. [2023-11-19 07:40:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 111 states have internal predecessors, (155), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:25,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2023-11-19 07:40:25,885 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 119 [2023-11-19 07:40:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:25,887 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2023-11-19 07:40:25,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2023-11-19 07:40:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:40:25,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:25,890 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:25,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:40:25,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:25,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash -409562581, now seen corresponding path program 1 times [2023-11-19 07:40:25,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:25,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352514434] [2023-11-19 07:40:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352514434] [2023-11-19 07:40:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352514434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469483231] [2023-11-19 07:40:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:26,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:26,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:26,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:26,267 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:26,352 INFO L93 Difference]: Finished difference Result 269 states and 387 transitions. [2023-11-19 07:40:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:26,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-11-19 07:40:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:26,354 INFO L225 Difference]: With dead ends: 269 [2023-11-19 07:40:26,355 INFO L226 Difference]: Without dead ends: 147 [2023-11-19 07:40:26,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:26,361 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 84 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:26,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 586 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-19 07:40:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2023-11-19 07:40:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 114 states have internal predecessors, (158), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2023-11-19 07:40:26,377 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 119 [2023-11-19 07:40:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:26,378 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2023-11-19 07:40:26,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2023-11-19 07:40:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:40:26,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:26,381 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:26,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:40:26,381 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:26,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2011536986, now seen corresponding path program 1 times [2023-11-19 07:40:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900851493] [2023-11-19 07:40:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900851493] [2023-11-19 07:40:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900851493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212757719] [2023-11-19 07:40:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:27,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:27,021 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:27,208 INFO L93 Difference]: Finished difference Result 253 states and 361 transitions. [2023-11-19 07:40:27,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:40:27,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2023-11-19 07:40:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:27,212 INFO L225 Difference]: With dead ends: 253 [2023-11-19 07:40:27,212 INFO L226 Difference]: Without dead ends: 128 [2023-11-19 07:40:27,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:40:27,214 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:27,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 341 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:40:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-19 07:40:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-19 07:40:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2023-11-19 07:40:27,224 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 120 [2023-11-19 07:40:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:27,225 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2023-11-19 07:40:27,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2023-11-19 07:40:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:27,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:27,228 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:40:27,228 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:27,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1924709268, now seen corresponding path program 1 times [2023-11-19 07:40:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132942029] [2023-11-19 07:40:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:27,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132942029] [2023-11-19 07:40:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132942029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135827580] [2023-11-19 07:40:27,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:27,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:40:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:27,607 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:27,623 INFO L93 Difference]: Finished difference Result 253 states and 357 transitions. [2023-11-19 07:40:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:27,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:27,626 INFO L225 Difference]: With dead ends: 253 [2023-11-19 07:40:27,626 INFO L226 Difference]: Without dead ends: 128 [2023-11-19 07:40:27,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:40:27,627 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:27,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-19 07:40:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-11-19 07:40:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 178 transitions. [2023-11-19 07:40:27,637 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 178 transitions. Word has length 122 [2023-11-19 07:40:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:27,637 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 178 transitions. [2023-11-19 07:40:27,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 178 transitions. [2023-11-19 07:40:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:27,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:27,640 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:27,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:40:27,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:27,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 235765526, now seen corresponding path program 1 times [2023-11-19 07:40:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:27,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322187855] [2023-11-19 07:40:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:28,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322187855] [2023-11-19 07:40:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322187855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:40:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058019253] [2023-11-19 07:40:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:40:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:28,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:40:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:40:28,913 INFO L87 Difference]: Start difference. First operand 128 states and 178 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:29,635 INFO L93 Difference]: Finished difference Result 366 states and 509 transitions. [2023-11-19 07:40:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:40:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:29,638 INFO L225 Difference]: With dead ends: 366 [2023-11-19 07:40:29,638 INFO L226 Difference]: Without dead ends: 241 [2023-11-19 07:40:29,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:40:29,640 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 394 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:29,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 779 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:40:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-19 07:40:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 146. [2023-11-19 07:40:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2023-11-19 07:40:29,652 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 122 [2023-11-19 07:40:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:29,653 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2023-11-19 07:40:29,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2023-11-19 07:40:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:29,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:29,655 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:29,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:40:29,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:29,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash -785302828, now seen corresponding path program 1 times [2023-11-19 07:40:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:29,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051806119] [2023-11-19 07:40:29,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:31,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051806119] [2023-11-19 07:40:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051806119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:40:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079602292] [2023-11-19 07:40:31,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:31,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:40:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:40:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:31,270 INFO L87 Difference]: Start difference. First operand 146 states and 203 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:31,817 INFO L93 Difference]: Finished difference Result 289 states and 403 transitions. [2023-11-19 07:40:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:40:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:31,822 INFO L225 Difference]: With dead ends: 289 [2023-11-19 07:40:31,822 INFO L226 Difference]: Without dead ends: 146 [2023-11-19 07:40:31,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:40:31,823 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:31,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 466 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:40:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-19 07:40:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-11-19 07:40:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2023-11-19 07:40:31,838 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 122 [2023-11-19 07:40:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:31,839 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2023-11-19 07:40:31,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2023-11-19 07:40:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:31,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:31,841 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:31,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:40:31,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:31,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1137925206, now seen corresponding path program 1 times [2023-11-19 07:40:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433894956] [2023-11-19 07:40:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433894956] [2023-11-19 07:40:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433894956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-19 07:40:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996606274] [2023-11-19 07:40:36,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:36,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 07:40:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 07:40:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:40:36,795 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:42,774 INFO L93 Difference]: Finished difference Result 447 states and 614 transitions. [2023-11-19 07:40:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-19 07:40:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:42,780 INFO L225 Difference]: With dead ends: 447 [2023-11-19 07:40:42,780 INFO L226 Difference]: Without dead ends: 305 [2023-11-19 07:40:42,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2023-11-19 07:40:42,782 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 459 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:42,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1740 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-19 07:40:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-19 07:40:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 155. [2023-11-19 07:40:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2023-11-19 07:40:42,804 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 122 [2023-11-19 07:40:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:42,805 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2023-11-19 07:40:42,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2023-11-19 07:40:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:42,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:42,808 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:40:42,809 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:42,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash -667513128, now seen corresponding path program 1 times [2023-11-19 07:40:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555685448] [2023-11-19 07:40:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555685448] [2023-11-19 07:40:43,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555685448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:40:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421846017] [2023-11-19 07:40:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:43,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:40:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:43,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:40:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:40:43,219 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:43,403 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2023-11-19 07:40:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:40:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:43,405 INFO L225 Difference]: With dead ends: 325 [2023-11-19 07:40:43,405 INFO L226 Difference]: Without dead ends: 173 [2023-11-19 07:40:43,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:40:43,407 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:43,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 438 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:40:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-19 07:40:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2023-11-19 07:40:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 147 states have internal predecessors, (195), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 219 transitions. [2023-11-19 07:40:43,425 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 219 transitions. Word has length 122 [2023-11-19 07:40:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 219 transitions. [2023-11-19 07:40:43,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 219 transitions. [2023-11-19 07:40:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:43,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:43,450 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:40:43,451 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:43,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash -526964518, now seen corresponding path program 1 times [2023-11-19 07:40:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005207977] [2023-11-19 07:40:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005207977] [2023-11-19 07:40:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005207977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:47,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:47,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:40:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801297314] [2023-11-19 07:40:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:47,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:40:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:47,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:40:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:40:47,900 INFO L87 Difference]: Start difference. First operand 161 states and 219 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:50,981 INFO L93 Difference]: Finished difference Result 406 states and 553 transitions. [2023-11-19 07:40:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:40:50,983 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:50,985 INFO L225 Difference]: With dead ends: 406 [2023-11-19 07:40:50,985 INFO L226 Difference]: Without dead ends: 248 [2023-11-19 07:40:50,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2023-11-19 07:40:50,987 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 385 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:50,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1156 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-19 07:40:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-19 07:40:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 154. [2023-11-19 07:40:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 140 states have internal predecessors, (186), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2023-11-19 07:40:51,001 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 122 [2023-11-19 07:40:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:51,002 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2023-11-19 07:40:51,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2023-11-19 07:40:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:51,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:51,004 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:40:51,005 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:51,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash -465834348, now seen corresponding path program 1 times [2023-11-19 07:40:51,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:51,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315185118] [2023-11-19 07:40:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315185118] [2023-11-19 07:40:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315185118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:53,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:53,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:40:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355555519] [2023-11-19 07:40:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:53,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:40:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:40:53,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:40:53,657 INFO L87 Difference]: Start difference. First operand 154 states and 210 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:55,371 INFO L93 Difference]: Finished difference Result 420 states and 575 transitions. [2023-11-19 07:40:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:40:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:55,375 INFO L225 Difference]: With dead ends: 420 [2023-11-19 07:40:55,375 INFO L226 Difference]: Without dead ends: 269 [2023-11-19 07:40:55,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:40:55,376 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 363 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:55,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1165 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:40:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-19 07:40:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 154. [2023-11-19 07:40:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 140 states have internal predecessors, (186), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2023-11-19 07:40:55,407 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 122 [2023-11-19 07:40:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:55,408 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2023-11-19 07:40:55,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2023-11-19 07:40:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:55,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:55,410 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:55,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:40:55,411 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:55,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1486902702, now seen corresponding path program 1 times [2023-11-19 07:40:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120109529] [2023-11-19 07:40:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120109529] [2023-11-19 07:40:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120109529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:56,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:56,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:40:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877015946] [2023-11-19 07:40:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:56,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:40:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:40:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:40:56,463 INFO L87 Difference]: Start difference. First operand 154 states and 210 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:57,135 INFO L93 Difference]: Finished difference Result 426 states and 577 transitions. [2023-11-19 07:40:57,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:40:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:57,139 INFO L225 Difference]: With dead ends: 426 [2023-11-19 07:40:57,139 INFO L226 Difference]: Without dead ends: 275 [2023-11-19 07:40:57,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:40:57,141 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 426 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:57,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 752 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:40:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-19 07:40:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 169. [2023-11-19 07:40:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2023-11-19 07:40:57,159 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 122 [2023-11-19 07:40:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:57,160 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2023-11-19 07:40:57,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2023-11-19 07:40:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:40:57,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:57,162 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:40:57,163 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:57,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash 436325332, now seen corresponding path program 1 times [2023-11-19 07:40:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950382639] [2023-11-19 07:40:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:57,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950382639] [2023-11-19 07:40:57,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950382639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:57,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:57,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:40:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265713945] [2023-11-19 07:40:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:57,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:40:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:40:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:40:57,925 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:58,474 INFO L93 Difference]: Finished difference Result 427 states and 581 transitions. [2023-11-19 07:40:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:40:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2023-11-19 07:40:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:58,477 INFO L225 Difference]: With dead ends: 427 [2023-11-19 07:40:58,477 INFO L226 Difference]: Without dead ends: 261 [2023-11-19 07:40:58,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 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:40:58,478 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 209 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:58,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 694 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:40:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-19 07:40:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 151. [2023-11-19 07:40:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 137 states have internal predecessors, (181), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2023-11-19 07:40:58,493 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 122 [2023-11-19 07:40:58,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:58,493 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2023-11-19 07:40:58,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2023-11-19 07:40:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:40:58,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:58,496 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:40:58,496 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:58,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1080186156, now seen corresponding path program 1 times [2023-11-19 07:40:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106539545] [2023-11-19 07:40:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:40:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:40:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:40:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:40:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:40:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:40:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:40:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:40:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:40:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:40:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:40:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:40:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:40:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106539545] [2023-11-19 07:40:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106539545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:58,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:58,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:40:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498868197] [2023-11-19 07:40:58,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:58,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:40:58,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:58,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:40:58,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:40:58,803 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:58,836 INFO L93 Difference]: Finished difference Result 310 states and 422 transitions. [2023-11-19 07:40:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:40:58,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2023-11-19 07:40:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:40:58,838 INFO L225 Difference]: With dead ends: 310 [2023-11-19 07:40:58,838 INFO L226 Difference]: Without dead ends: 162 [2023-11-19 07:40:58,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:40:58,839 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 46 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:40:58,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 419 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:40:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-19 07:40:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2023-11-19 07:40:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 137 states have (on average 1.313868613138686) internal successors, (180), 137 states have internal predecessors, (180), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-19 07:40:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 204 transitions. [2023-11-19 07:40:58,853 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 204 transitions. Word has length 125 [2023-11-19 07:40:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:40:58,853 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 204 transitions. [2023-11-19 07:40:58,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-19 07:40:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 204 transitions. [2023-11-19 07:40:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-19 07:40:58,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:40:58,856 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:40:58,856 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:40:58,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 985387117, now seen corresponding path program 1 times [2023-11-19 07:40:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293741975] [2023-11-19 07:40:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:41:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:41:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:41:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:41:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-19 07:41:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:41:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:41:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:41:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:41:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:41:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-19 07:41:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293741975] [2023-11-19 07:41:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293741975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:41:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673358390] [2023-11-19 07:41:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:00,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:41:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:41:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:41:00,229 INFO L87 Difference]: Start difference. First operand 151 states and 204 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)