./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.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_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/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_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/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_30314ee3-62b7-4155-9657-1194b1083aa9/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 af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:27,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:27,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:42:27,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:27,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:27,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:27,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:27,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:27,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:27,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:27,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:27,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:27,948 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:27,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:27,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:42:27,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:27,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:42:27,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:27,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:27,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:42:27,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:27,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:42:27,959 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:27,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:42:27,961 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:27,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:27,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:27,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:27,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:27,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:27,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:27,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:42:27,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:42:27,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:42:27,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:27,967 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:42:27,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:27,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:27,967 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:27,967 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_30314ee3-62b7-4155-9657-1194b1083aa9/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_30314ee3-62b7-4155-9657-1194b1083aa9/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 -> af611b85592e3bfdb76cb3d02db14972ec0514184947c9ed0792744d9af89e7a [2023-11-19 07:42:28,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:28,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:28,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:28,359 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:28,359 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:28,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-19 07:42:31,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:42:31,827 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:42:31,827 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i [2023-11-19 07:42:31,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/data/50f46c1b0/8f2317becd814070b778db5c7347b6e7/FLAG648b34567 [2023-11-19 07:42:31,861 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/data/50f46c1b0/8f2317becd814070b778db5c7347b6e7 [2023-11-19 07:42:31,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:42:31,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:42:31,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:31,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:42:31,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:42:31,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adf5719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31, skipping insertion in model container [2023-11-19 07:42:31,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,913 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:42:32,070 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_30314ee3-62b7-4155-9657-1194b1083aa9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-19 07:42:32,132 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:32,144 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:42:32,158 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_30314ee3-62b7-4155-9657-1194b1083aa9/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-15.i[916,929] [2023-11-19 07:42:32,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:32,246 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:42:32,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32 WrapperNode [2023-11-19 07:42:32,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:32,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:32,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:42:32,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:42:32,262 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:42:32" (1/1) ... [2023-11-19 07:42:32,278 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:42:32" (1/1) ... [2023-11-19 07:42:32,329 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2023-11-19 07:42:32,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:32,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:42:32,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:42:32,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:42:32,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:42:32,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:42:32,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:42:32,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:42:32,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (1/1) ... [2023-11-19 07:42:32,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:42:32,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/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:42:32,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30314ee3-62b7-4155-9657-1194b1083aa9/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:42:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:42:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:42:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:42:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:42:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:42:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:42:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:42:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:42:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:42:32,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:42:32,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:42:32,754 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:42:32,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:42:33,407 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:42:33,417 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:42:33,417 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:42:33,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:33 BoogieIcfgContainer [2023-11-19 07:42:33,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:42:33,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:42:33,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:42:33,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:42:33,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:31" (1/3) ... [2023-11-19 07:42:33,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1142b0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:33, skipping insertion in model container [2023-11-19 07:42:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:32" (2/3) ... [2023-11-19 07:42:33,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1142b0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:33, skipping insertion in model container [2023-11-19 07:42:33,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:33" (3/3) ... [2023-11-19 07:42:33,434 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-15.i [2023-11-19 07:42:33,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:42:33,455 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:42:33,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:42:33,519 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;@6e72cb19, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:42:33,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:42:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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:42:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:42:33,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:33,538 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] [2023-11-19 07:42:33,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:33,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2045303348, now seen corresponding path program 1 times [2023-11-19 07:42:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:33,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312664429] [2023-11-19 07:42:33,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:33,989 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:42:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:33,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312664429] [2023-11-19 07:42:33,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312664429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:33,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:42:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228038741] [2023-11-19 07:42:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:42:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:42:34,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:42:34,069 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 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.0) internal successors, (58), 2 states have internal predecessors, (58), 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:42:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:34,125 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2023-11-19 07:42:34,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:42:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 115 [2023-11-19 07:42:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:34,142 INFO L225 Difference]: With dead ends: 219 [2023-11-19 07:42:34,143 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 07:42:34,148 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:42:34,153 INFO L413 NwaCegarLoop]: 157 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, 157 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:42:34,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:42:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 07:42:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-19 07:42:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 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:42:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-19 07:42:34,206 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2023-11-19 07:42:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:34,207 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-19 07:42:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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:42:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-19 07:42:34,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:42:34,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:34,213 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] [2023-11-19 07:42:34,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:42:34,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:34,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 523381052, now seen corresponding path program 1 times [2023-11-19 07:42:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797410279] [2023-11-19 07:42:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:34,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:34,759 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:42:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797410279] [2023-11-19 07:42:34,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797410279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:34,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:34,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494201167] [2023-11-19 07:42:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:34,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:42:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:42:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:42:34,764 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:42:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:34,793 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2023-11-19 07:42:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:42:34,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2023-11-19 07:42:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:34,796 INFO L225 Difference]: With dead ends: 213 [2023-11-19 07:42:34,797 INFO L226 Difference]: Without dead ends: 107 [2023-11-19 07:42:34,798 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:42:34,800 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 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:42:34,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:42:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-19 07:42:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-19 07:42:34,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 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:42:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2023-11-19 07:42:34,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2023-11-19 07:42:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:34,818 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2023-11-19 07:42:34,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:42:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2023-11-19 07:42:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:42:34,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:34,821 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] [2023-11-19 07:42:34,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:42:34,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:34,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 395217285, now seen corresponding path program 1 times [2023-11-19 07:42:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297416334] [2023-11-19 07:42:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,105 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:42:35,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:35,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297416334] [2023-11-19 07:42:35,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297416334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785977814] [2023-11-19 07:42:35,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:35,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:42:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:42:35,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:42:35,115 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:42:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:35,180 INFO L93 Difference]: Finished difference Result 235 states and 338 transitions. [2023-11-19 07:42:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:42:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 115 [2023-11-19 07:42:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:35,186 INFO L225 Difference]: With dead ends: 235 [2023-11-19 07:42:35,186 INFO L226 Difference]: Without dead ends: 131 [2023-11-19 07:42:35,188 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:42:35,192 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:35,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:42:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-19 07:42:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-11-19 07:42:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 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:42:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-19 07:42:35,217 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2023-11-19 07:42:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:35,218 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-19 07:42:35,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:42:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-19 07:42:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:42:35,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:35,229 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] [2023-11-19 07:42:35,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:42:35,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:35,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash 653382723, now seen corresponding path program 1 times [2023-11-19 07:42:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:35,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674818300] [2023-11-19 07:42:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:35,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:36,007 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:42:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674818300] [2023-11-19 07:42:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674818300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:36,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:42:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242850794] [2023-11-19 07:42:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:36,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:36,018 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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:42:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:36,618 INFO L93 Difference]: Finished difference Result 278 states and 395 transitions. [2023-11-19 07:42:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:42:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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 115 [2023-11-19 07:42:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:36,632 INFO L225 Difference]: With dead ends: 278 [2023-11-19 07:42:36,632 INFO L226 Difference]: Without dead ends: 173 [2023-11-19 07:42:36,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:42:36,639 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 233 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:36,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 478 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:42:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-19 07:42:36,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2023-11-19 07:42:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 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:42:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2023-11-19 07:42:36,667 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 115 [2023-11-19 07:42:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:36,668 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2023-11-19 07:42:36,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (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:42:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2023-11-19 07:42:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:42:36,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:36,672 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:42:36,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:42:36,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:36,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1044361379, now seen corresponding path program 1 times [2023-11-19 07:42:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:36,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386109852] [2023-11-19 07:42:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:37,598 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:42:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386109852] [2023-11-19 07:42:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386109852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:42:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572090421] [2023-11-19 07:42:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:37,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:42:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:42:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:42:37,606 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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:42:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:38,222 INFO L93 Difference]: Finished difference Result 306 states and 435 transitions. [2023-11-19 07:42:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:42:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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:42:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:38,225 INFO L225 Difference]: With dead ends: 306 [2023-11-19 07:42:38,226 INFO L226 Difference]: Without dead ends: 192 [2023-11-19 07:42:38,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:42:38,229 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 219 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:38,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 585 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:42:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-19 07:42:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2023-11-19 07:42:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 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:42:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2023-11-19 07:42:38,250 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 116 [2023-11-19 07:42:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:38,252 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2023-11-19 07:42:38,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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:42:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2023-11-19 07:42:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:42:38,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:38,257 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:42:38,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:42:38,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:38,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1862009829, now seen corresponding path program 1 times [2023-11-19 07:42:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:38,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838229768] [2023-11-19 07:42:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:39,771 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:42:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838229768] [2023-11-19 07:42:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838229768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:42:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90044522] [2023-11-19 07:42:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:42:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:42:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:42:39,775 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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:42:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:40,372 INFO L93 Difference]: Finished difference Result 394 states and 566 transitions. [2023-11-19 07:42:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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:42:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:40,376 INFO L225 Difference]: With dead ends: 394 [2023-11-19 07:42:40,376 INFO L226 Difference]: Without dead ends: 271 [2023-11-19 07:42:40,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:42:40,378 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 275 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:40,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 498 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:42:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-19 07:42:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 226. [2023-11-19 07:42:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:42:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2023-11-19 07:42:40,405 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 116 [2023-11-19 07:42:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:40,405 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2023-11-19 07:42:40,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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:42:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2023-11-19 07:42:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:42:40,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:40,408 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] [2023-11-19 07:42:40,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:42:40,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:40,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2070143913, now seen corresponding path program 1 times [2023-11-19 07:42:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146027572] [2023-11-19 07:42:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,414 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:42:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:41,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146027572] [2023-11-19 07:42:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146027572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:41,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:42:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160150699] [2023-11-19 07:42:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:41,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:41,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:41,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:41,417 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:42:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:41,810 INFO L93 Difference]: Finished difference Result 453 states and 651 transitions. [2023-11-19 07:42:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:42:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 117 [2023-11-19 07:42:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:41,813 INFO L225 Difference]: With dead ends: 453 [2023-11-19 07:42:41,814 INFO L226 Difference]: Without dead ends: 230 [2023-11-19 07:42:41,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:41,819 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 104 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:41,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 408 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:42:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-19 07:42:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2023-11-19 07:42:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3819095477386936) internal successors, (275), 199 states have internal predecessors, (275), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:42:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 323 transitions. [2023-11-19 07:42:41,855 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 323 transitions. Word has length 117 [2023-11-19 07:42:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:41,856 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 323 transitions. [2023-11-19 07:42:41,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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:42:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 323 transitions. [2023-11-19 07:42:41,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:42:41,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:41,860 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:42:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:42:41,861 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:41,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -463452726, now seen corresponding path program 1 times [2023-11-19 07:42:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22166310] [2023-11-19 07:42:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:42,629 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:42:42,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22166310] [2023-11-19 07:42:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22166310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:42,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:42:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420900163] [2023-11-19 07:42:42,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:42,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:42,632 INFO L87 Difference]: Start difference. First operand 226 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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:42:43,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:43,135 INFO L93 Difference]: Finished difference Result 570 states and 805 transitions. [2023-11-19 07:42:43,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:43,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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:42:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:43,138 INFO L225 Difference]: With dead ends: 570 [2023-11-19 07:42:43,139 INFO L226 Difference]: Without dead ends: 347 [2023-11-19 07:42:43,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:42:43,140 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 286 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:43,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 338 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:42:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-11-19 07:42:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 314. [2023-11-19 07:42:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 281 states have (on average 1.3665480427046264) internal successors, (384), 283 states have internal predecessors, (384), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:42:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 440 transitions. [2023-11-19 07:42:43,175 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 440 transitions. Word has length 118 [2023-11-19 07:42:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:43,176 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 440 transitions. [2023-11-19 07:42:43,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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:42:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 440 transitions. [2023-11-19 07:42:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:42:43,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:43,178 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:42:43,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:42:43,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:43,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1810249, now seen corresponding path program 1 times [2023-11-19 07:42:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861871957] [2023-11-19 07:42:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,671 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:42:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861871957] [2023-11-19 07:42:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861871957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:42:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064990487] [2023-11-19 07:42:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:43,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:42:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:42:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:42:43,677 INFO L87 Difference]: Start difference. First operand 314 states and 440 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:42:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:44,165 INFO L93 Difference]: Finished difference Result 879 states and 1228 transitions. [2023-11-19 07:42:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:42:44,166 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:42:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:44,171 INFO L225 Difference]: With dead ends: 879 [2023-11-19 07:42:44,172 INFO L226 Difference]: Without dead ends: 568 [2023-11-19 07:42:44,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:42:44,175 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 303 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:44,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 553 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:42:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2023-11-19 07:42:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 356. [2023-11-19 07:42:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 323 states have (on average 1.3498452012383901) internal successors, (436), 325 states have internal predecessors, (436), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:42:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2023-11-19 07:42:44,220 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 118 [2023-11-19 07:42:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:44,221 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2023-11-19 07:42:44,221 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:42:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2023-11-19 07:42:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:44,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:44,224 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:42:44,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:42:44,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:44,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1145039086, now seen corresponding path program 1 times [2023-11-19 07:42:44,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:44,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100833602] [2023-11-19 07:42:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:44,769 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:42:44,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:44,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100833602] [2023-11-19 07:42:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100833602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:42:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838229048] [2023-11-19 07:42:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:44,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:44,772 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:42:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:45,123 INFO L93 Difference]: Finished difference Result 574 states and 797 transitions. [2023-11-19 07:42:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:45,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:42:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:45,126 INFO L225 Difference]: With dead ends: 574 [2023-11-19 07:42:45,126 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 07:42:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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:42:45,127 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 130 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 378 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:42:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 07:42:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 360. [2023-11-19 07:42:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 327 states have (on average 1.345565749235474) internal successors, (440), 329 states have internal predecessors, (440), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:42:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 496 transitions. [2023-11-19 07:42:45,166 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 496 transitions. Word has length 119 [2023-11-19 07:42:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:45,167 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 496 transitions. [2023-11-19 07:42:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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:42:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 496 transitions. [2023-11-19 07:42:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:45,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:45,170 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:42:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:42:45,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:45,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1290716798, now seen corresponding path program 1 times [2023-11-19 07:42:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651928525] [2023-11-19 07:42:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:47,396 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:42:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651928525] [2023-11-19 07:42:47,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651928525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:47,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:42:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542942026] [2023-11-19 07:42:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:42:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:42:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:42:47,399 INFO L87 Difference]: Start difference. First operand 360 states and 496 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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:42:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:48,772 INFO L93 Difference]: Finished difference Result 816 states and 1119 transitions. [2023-11-19 07:42:48,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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:42:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:48,778 INFO L225 Difference]: With dead ends: 816 [2023-11-19 07:42:48,779 INFO L226 Difference]: Without dead ends: 459 [2023-11-19 07:42:48,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:42:48,781 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 321 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:48,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 720 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:42:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-19 07:42:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 369. [2023-11-19 07:42:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 336 states have (on average 1.3392857142857142) internal successors, (450), 338 states have internal predecessors, (450), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:42:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 506 transitions. [2023-11-19 07:42:48,827 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 506 transitions. Word has length 119 [2023-11-19 07:42:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:48,828 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 506 transitions. [2023-11-19 07:42:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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:42:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 506 transitions. [2023-11-19 07:42:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:48,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:48,831 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:42:48,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:42:48,832 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:48,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1800189888, now seen corresponding path program 1 times [2023-11-19 07:42:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:48,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790412550] [2023-11-19 07:42:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:48,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,961 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:42:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790412550] [2023-11-19 07:42:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790412550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:42:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131479674] [2023-11-19 07:42:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:50,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:42:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:42:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:42:50,965 INFO L87 Difference]: Start difference. First operand 369 states and 506 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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:42:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:52,220 INFO L93 Difference]: Finished difference Result 772 states and 1057 transitions. [2023-11-19 07:42:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:42:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 119 [2023-11-19 07:42:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:52,224 INFO L225 Difference]: With dead ends: 772 [2023-11-19 07:42:52,224 INFO L226 Difference]: Without dead ends: 406 [2023-11-19 07:42:52,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:42:52,226 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 260 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:52,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 645 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:42:52,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-11-19 07:42:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 369. [2023-11-19 07:42:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 336 states have (on average 1.3363095238095237) internal successors, (449), 338 states have internal predecessors, (449), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:42:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 505 transitions. [2023-11-19 07:42:52,266 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 505 transitions. Word has length 119 [2023-11-19 07:42:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:52,266 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 505 transitions. [2023-11-19 07:42:52,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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:42:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 505 transitions. [2023-11-19 07:42:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:52,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:52,269 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:42:52,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:42:52,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:52,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 5248446, now seen corresponding path program 1 times [2023-11-19 07:42:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:52,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587441654] [2023-11-19 07:42:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:52,763 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:42:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587441654] [2023-11-19 07:42:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587441654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:42:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541118976] [2023-11-19 07:42:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:52,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:52,767 INFO L87 Difference]: Start difference. First operand 369 states and 505 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:53,288 INFO L93 Difference]: Finished difference Result 837 states and 1141 transitions. [2023-11-19 07:42:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:53,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:53,294 INFO L225 Difference]: With dead ends: 837 [2023-11-19 07:42:53,294 INFO L226 Difference]: Without dead ends: 439 [2023-11-19 07:42:53,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:42:53,296 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 287 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:53,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 432 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:42:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-19 07:42:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 335. [2023-11-19 07:42:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 304 states have (on average 1.3223684210526316) internal successors, (402), 305 states have internal predecessors, (402), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-19 07:42:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2023-11-19 07:42:53,337 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 119 [2023-11-19 07:42:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:53,337 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2023-11-19 07:42:53,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2023-11-19 07:42:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:53,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:53,340 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:42:53,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:42:53,341 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:53,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:53,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1369422809, now seen corresponding path program 1 times [2023-11-19 07:42:53,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293954047] [2023-11-19 07:42:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,872 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:42:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293954047] [2023-11-19 07:42:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293954047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:42:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644476798] [2023-11-19 07:42:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:53,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:53,876 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:54,373 INFO L93 Difference]: Finished difference Result 651 states and 879 transitions. [2023-11-19 07:42:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:54,380 INFO L225 Difference]: With dead ends: 651 [2023-11-19 07:42:54,380 INFO L226 Difference]: Without dead ends: 443 [2023-11-19 07:42:54,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:42:54,381 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 335 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:54,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 312 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:42:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-19 07:42:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 272. [2023-11-19 07:42:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 243 states have internal predecessors, (317), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:42:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 365 transitions. [2023-11-19 07:42:54,420 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 365 transitions. Word has length 119 [2023-11-19 07:42:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:54,421 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 365 transitions. [2023-11-19 07:42:54,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2023-11-19 07:42:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:42:54,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:54,424 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:42:54,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:42:54,424 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:54,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:54,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1914427237, now seen corresponding path program 1 times [2023-11-19 07:42:54,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:54,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535419289] [2023-11-19 07:42:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:54,973 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:42:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535419289] [2023-11-19 07:42:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535419289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:42:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352204756] [2023-11-19 07:42:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:54,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:54,989 INFO L87 Difference]: Start difference. First operand 272 states and 365 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:55,350 INFO L93 Difference]: Finished difference Result 447 states and 600 transitions. [2023-11-19 07:42:55,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:55,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:55,354 INFO L225 Difference]: With dead ends: 447 [2023-11-19 07:42:55,354 INFO L226 Difference]: Without dead ends: 302 [2023-11-19 07:42:55,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:42:55,357 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 228 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:55,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 331 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:42:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-19 07:42:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 272. [2023-11-19 07:42:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.300411522633745) internal successors, (316), 243 states have internal predecessors, (316), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:42:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 364 transitions. [2023-11-19 07:42:55,396 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 364 transitions. Word has length 119 [2023-11-19 07:42:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 364 transitions. [2023-11-19 07:42:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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:42:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 364 transitions. [2023-11-19 07:42:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:42:55,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:55,399 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:42:55,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:42:55,399 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:55,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash -437944966, now seen corresponding path program 1 times [2023-11-19 07:42:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711011464] [2023-11-19 07:42:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:42:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:42:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:42:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:42:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:42:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:42:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:42:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:42:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:42:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:42:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:42:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:42:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:57,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:42:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711011464] [2023-11-19 07:42:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711011464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:42:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493241314] [2023-11-19 07:42:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:57,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:42:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:42:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:42:57,020 INFO L87 Difference]: Start difference. First operand 272 states and 364 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:42:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:42:57,888 INFO L93 Difference]: Finished difference Result 584 states and 779 transitions. [2023-11-19 07:42:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:42:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:42:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:42:57,891 INFO L225 Difference]: With dead ends: 584 [2023-11-19 07:42:57,891 INFO L226 Difference]: Without dead ends: 315 [2023-11-19 07:42:57,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:42:57,893 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 352 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:42:57,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 485 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:42:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-19 07:42:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 280. [2023-11-19 07:42:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 251 states have (on average 1.294820717131474) internal successors, (325), 251 states have internal predecessors, (325), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:42:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 373 transitions. [2023-11-19 07:42:57,924 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 373 transitions. Word has length 120 [2023-11-19 07:42:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:42:57,925 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 373 transitions. [2023-11-19 07:42:57,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 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:42:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 373 transitions. [2023-11-19 07:42:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-19 07:42:57,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:42:57,929 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:42:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:42:57,929 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:42:57,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 948258428, now seen corresponding path program 1 times [2023-11-19 07:42:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041743162] [2023-11-19 07:42:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:00,385 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:43:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041743162] [2023-11-19 07:43:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041743162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 07:43:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870269657] [2023-11-19 07:43:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:00,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:43:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:43:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:43:00,388 INFO L87 Difference]: Start difference. First operand 280 states and 373 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-19 07:43:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:01,917 INFO L93 Difference]: Finished difference Result 589 states and 784 transitions. [2023-11-19 07:43:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:43:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2023-11-19 07:43:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:01,920 INFO L225 Difference]: With dead ends: 589 [2023-11-19 07:43:01,920 INFO L226 Difference]: Without dead ends: 312 [2023-11-19 07:43:01,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:43:01,922 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 477 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:01,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 760 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:43:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-19 07:43:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 272. [2023-11-19 07:43:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 243 states have (on average 1.2962962962962963) internal successors, (315), 243 states have internal predecessors, (315), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 363 transitions. [2023-11-19 07:43:01,958 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 363 transitions. Word has length 120 [2023-11-19 07:43:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:01,958 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 363 transitions. [2023-11-19 07:43:01,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-19 07:43:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 363 transitions. [2023-11-19 07:43:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:43:01,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:01,961 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] [2023-11-19 07:43:01,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:43:01,962 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:01,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2103925053, now seen corresponding path program 1 times [2023-11-19 07:43:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:01,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716759014] [2023-11-19 07:43:01,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:01,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:02,404 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:43:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716759014] [2023-11-19 07:43:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716759014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 07:43:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126117071] [2023-11-19 07:43:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 07:43:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 07:43:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:43:02,408 INFO L87 Difference]: Start difference. First operand 272 states and 363 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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:43:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:03,012 INFO L93 Difference]: Finished difference Result 724 states and 972 transitions. [2023-11-19 07:43:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:43:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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 121 [2023-11-19 07:43:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:03,016 INFO L225 Difference]: With dead ends: 724 [2023-11-19 07:43:03,016 INFO L226 Difference]: Without dead ends: 455 [2023-11-19 07:43:03,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:43:03,018 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 486 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:03,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 679 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:43:03,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-11-19 07:43:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 298. [2023-11-19 07:43:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 269 states have (on average 1.2899628252788105) internal successors, (347), 269 states have internal predecessors, (347), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 395 transitions. [2023-11-19 07:43:03,050 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 395 transitions. Word has length 121 [2023-11-19 07:43:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:03,050 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 395 transitions. [2023-11-19 07:43:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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:43:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 395 transitions. [2023-11-19 07:43:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:43:03,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:03,053 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] [2023-11-19 07:43:03,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:43:03,053 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:03,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1885070335, now seen corresponding path program 1 times [2023-11-19 07:43:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922902555] [2023-11-19 07:43:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,387 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:43:03,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:03,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922902555] [2023-11-19 07:43:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922902555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:43:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751100849] [2023-11-19 07:43:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:43:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:43:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:43:03,390 INFO L87 Difference]: Start difference. First operand 298 states and 395 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:43:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:03,927 INFO L93 Difference]: Finished difference Result 726 states and 967 transitions. [2023-11-19 07:43:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:43:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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 121 [2023-11-19 07:43:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:03,931 INFO L225 Difference]: With dead ends: 726 [2023-11-19 07:43:03,931 INFO L226 Difference]: Without dead ends: 431 [2023-11-19 07:43:03,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-19 07:43:03,935 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:03,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 555 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 07:43:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-19 07:43:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 295. [2023-11-19 07:43:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.2857142857142858) internal successors, (342), 266 states have internal predecessors, (342), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 390 transitions. [2023-11-19 07:43:03,967 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 390 transitions. Word has length 121 [2023-11-19 07:43:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:03,968 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 390 transitions. [2023-11-19 07:43:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 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:43:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2023-11-19 07:43:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:43:03,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:03,971 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] [2023-11-19 07:43:03,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:43:03,972 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:03,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash 180170145, now seen corresponding path program 1 times [2023-11-19 07:43:03,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428465818] [2023-11-19 07:43:03,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:04,567 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:43:04,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428465818] [2023-11-19 07:43:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428465818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:43:04,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216625398] [2023-11-19 07:43:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:04,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:43:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:04,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:43:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:43:04,571 INFO L87 Difference]: Start difference. First operand 295 states and 390 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:43:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:05,100 INFO L93 Difference]: Finished difference Result 570 states and 752 transitions. [2023-11-19 07:43:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:43:05,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 121 [2023-11-19 07:43:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:05,103 INFO L225 Difference]: With dead ends: 570 [2023-11-19 07:43:05,104 INFO L226 Difference]: Without dead ends: 381 [2023-11-19 07:43:05,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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:43:05,105 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 323 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:05,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 353 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:43:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-19 07:43:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 295. [2023-11-19 07:43:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 266 states have (on average 1.281954887218045) internal successors, (341), 266 states have internal predecessors, (341), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 389 transitions. [2023-11-19 07:43:05,136 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 389 transitions. Word has length 121 [2023-11-19 07:43:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:05,136 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 389 transitions. [2023-11-19 07:43:05,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:43:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 389 transitions. [2023-11-19 07:43:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:43:05,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:05,139 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] [2023-11-19 07:43:05,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:43:05,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:05,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -402162992, now seen corresponding path program 1 times [2023-11-19 07:43:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:05,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5685099] [2023-11-19 07:43:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:07,068 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:43:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5685099] [2023-11-19 07:43:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5685099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:43:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273652525] [2023-11-19 07:43:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:07,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:43:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:43:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:43:07,072 INFO L87 Difference]: Start difference. First operand 295 states and 389 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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) [2023-11-19 07:43:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:09,577 INFO L93 Difference]: Finished difference Result 643 states and 845 transitions. [2023-11-19 07:43:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:43:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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) Word has length 121 [2023-11-19 07:43:09,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:09,581 INFO L225 Difference]: With dead ends: 643 [2023-11-19 07:43:09,582 INFO L226 Difference]: Without dead ends: 481 [2023-11-19 07:43:09,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:43:09,584 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 301 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:09,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1133 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-19 07:43:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-11-19 07:43:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 325. [2023-11-19 07:43:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 294 states have (on average 1.2687074829931972) internal successors, (373), 294 states have internal predecessors, (373), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 421 transitions. [2023-11-19 07:43:09,622 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 421 transitions. Word has length 121 [2023-11-19 07:43:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:09,623 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 421 transitions. [2023-11-19 07:43:09,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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) [2023-11-19 07:43:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 421 transitions. [2023-11-19 07:43:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-19 07:43:09,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:09,626 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] [2023-11-19 07:43:09,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:43:09,627 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:09,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -340123378, now seen corresponding path program 1 times [2023-11-19 07:43:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675590041] [2023-11-19 07:43:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:43:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:43:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:43:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:43:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:43:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:43:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:43:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:43:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:43:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:43:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:43:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-19 07:43:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,419 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:43:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675590041] [2023-11-19 07:43:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675590041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:43:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133658130] [2023-11-19 07:43:10,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:43:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:43:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:43:10,422 INFO L87 Difference]: Start difference. First operand 325 states and 421 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:43:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:43:11,100 INFO L93 Difference]: Finished difference Result 598 states and 778 transitions. [2023-11-19 07:43:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:43:11,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 121 [2023-11-19 07:43:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:43:11,105 INFO L225 Difference]: With dead ends: 598 [2023-11-19 07:43:11,105 INFO L226 Difference]: Without dead ends: 410 [2023-11-19 07:43:11,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:43:11,108 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:43:11,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 447 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 07:43:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-19 07:43:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 303. [2023-11-19 07:43:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 272 states have (on average 1.2683823529411764) internal successors, (345), 272 states have internal predecessors, (345), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 07:43:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 393 transitions. [2023-11-19 07:43:11,141 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 393 transitions. Word has length 121 [2023-11-19 07:43:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:43:11,141 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 393 transitions. [2023-11-19 07:43:11,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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:43:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 393 transitions. [2023-11-19 07:43:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:43:11,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:43:11,144 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:43:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:43:11,145 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:43:11,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1783189373, now seen corresponding path program 1 times [2023-11-19 07:43:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349807377] [2023-11-19 07:43:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat