./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.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_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/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_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/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_5bd50da9-b10a-4718-b00a-360a2d0092af/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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:53:53,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:53:53,246 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:53:53,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:53:53,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:53:53,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:53:53,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:53:53,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:53:53,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:53:53,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:53:53,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:53:53,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:53:53,311 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:53:53,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:53:53,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:53:53,316 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:53:53,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:53:53,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:53:53,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:53:53,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:53:53,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:53:53,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:53:53,320 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:53:53,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:53:53,321 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:53:53,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:53:53,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:53:53,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:53:53,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:53,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:53:53,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:53:53,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:53:53,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:53:53,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:53:53,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:53:53,342 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:53:53,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:53:53,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:53:53,342 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:53:53,343 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_5bd50da9-b10a-4718-b00a-360a2d0092af/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_5bd50da9-b10a-4718-b00a-360a2d0092af/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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2023-11-19 07:53:53,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:53:53,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:53:53,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:53:53,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:53:53,716 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:53:53,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2023-11-19 07:53:56,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:53:57,074 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:53:57,083 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2023-11-19 07:53:57,096 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/data/8d4eba415/a54c358f97ce494f9cc63499918bca73/FLAGb40f83e2d [2023-11-19 07:53:57,113 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/data/8d4eba415/a54c358f97ce494f9cc63499918bca73 [2023-11-19 07:53:57,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:53:57,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:53:57,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:57,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:53:57,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:53:57,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360ca94e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57, skipping insertion in model container [2023-11-19 07:53:57,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,174 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:53:57,362 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_5bd50da9-b10a-4718-b00a-360a2d0092af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i[916,929] [2023-11-19 07:53:57,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:57,444 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:53:57,459 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_5bd50da9-b10a-4718-b00a-360a2d0092af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i[916,929] [2023-11-19 07:53:57,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:53:57,550 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:53:57,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57 WrapperNode [2023-11-19 07:53:57,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:53:57,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:57,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:53:57,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:53:57,566 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:53:57" (1/1) ... [2023-11-19 07:53:57,593 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:53:57" (1/1) ... [2023-11-19 07:53:57,646 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 383 [2023-11-19 07:53:57,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:53:57,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:53:57,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:53:57,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:53:57,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:53:57,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:53:57,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:53:57,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:53:57,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (1/1) ... [2023-11-19 07:53:57,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:53:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:53:57,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/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:53:57,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5bd50da9-b10a-4718-b00a-360a2d0092af/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:53:57,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:53:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:53:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:53:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:53:57,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:53:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:53:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:53:57,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:53:57,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:53:57,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:53:57,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:53:57,953 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:53:57,958 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:53:58,714 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:53:58,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:53:58,729 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:53:58,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:58 BoogieIcfgContainer [2023-11-19 07:53:58,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:53:58,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:53:58,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:53:58,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:53:58,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:57" (1/3) ... [2023-11-19 07:53:58,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6951588a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:58, skipping insertion in model container [2023-11-19 07:53:58,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:57" (2/3) ... [2023-11-19 07:53:58,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6951588a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:53:58, skipping insertion in model container [2023-11-19 07:53:58,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:53:58" (3/3) ... [2023-11-19 07:53:58,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2023-11-19 07:53:58,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:53:58,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:53:58,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:53:58,838 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;@79d16dbf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:53:58,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:53:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:53:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:53:58,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:58,866 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:58,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1017449549, now seen corresponding path program 1 times [2023-11-19 07:53:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020690793] [2023-11-19 07:53:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:58,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:53:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:53:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:53:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:53:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:53:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:53:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:53:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:53:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:53:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:53:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:53:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:53:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:53:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:53:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:53:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:53:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:53:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:53:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:53:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:53:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020690793] [2023-11-19 07:53:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020690793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:53:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:53:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:53:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021137933] [2023-11-19 07:53:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:53:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:53:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:53:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:53:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:53:59,514 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:53:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:53:59,564 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2023-11-19 07:53:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:53:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-19 07:53:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:53:59,573 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:53:59,574 INFO L226 Difference]: Without dead ends: 99 [2023-11-19 07:53:59,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:53:59,581 INFO L413 NwaCegarLoop]: 141 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, 141 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:53:59,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:53:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-19 07:53:59,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-19 07:53:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:53:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-19 07:53:59,645 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2023-11-19 07:53:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:53:59,646 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-19 07:53:59,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:53:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-19 07:53:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:53:59,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:53:59,652 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:59,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:53:59,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:53:59,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:53:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash 695807149, now seen corresponding path program 1 times [2023-11-19 07:53:59,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:53:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636475904] [2023-11-19 07:53:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:53:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:53:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:53:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:53:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:53:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:53:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:00,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636475904] [2023-11-19 07:54:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636475904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:54:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305207465] [2023-11-19 07:54:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:54:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:54:00,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:54:00,091 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:00,164 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-11-19 07:54:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:54:00,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-19 07:54:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:00,168 INFO L225 Difference]: With dead ends: 199 [2023-11-19 07:54:00,169 INFO L226 Difference]: Without dead ends: 103 [2023-11-19 07:54:00,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:00,172 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:00,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-19 07:54:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-19 07:54:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 07:54:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-19 07:54:00,191 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2023-11-19 07:54:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:00,193 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-19 07:54:00,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-19 07:54:00,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-19 07:54:00,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:00,197 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:00,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:54:00,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:00,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 697654191, now seen corresponding path program 1 times [2023-11-19 07:54:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129024517] [2023-11-19 07:54:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129024517] [2023-11-19 07:54:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129024517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:00,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:54:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94777761] [2023-11-19 07:54:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:00,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:54:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:54:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:54:00,801 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:01,272 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2023-11-19 07:54:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-19 07:54:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:01,277 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:54:01,277 INFO L226 Difference]: Without dead ends: 202 [2023-11-19 07:54:01,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:54:01,280 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:01,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 476 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:54:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-19 07:54:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 169. [2023-11-19 07:54:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 126 states have internal predecessors, (160), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2023-11-19 07:54:01,316 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 150 [2023-11-19 07:54:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:01,317 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2023-11-19 07:54:01,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2023-11-19 07:54:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-19 07:54:01,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:01,322 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:01,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:54:01,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:01,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:01,323 INFO L85 PathProgramCache]: Analyzing trace with hash -233272627, now seen corresponding path program 1 times [2023-11-19 07:54:01,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925386005] [2023-11-19 07:54:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:01,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:08,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:08,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925386005] [2023-11-19 07:54:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925386005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-19 07:54:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113191212] [2023-11-19 07:54:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:08,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 07:54:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 07:54:08,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:54:08,598 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:13,842 INFO L93 Difference]: Finished difference Result 358 states and 507 transitions. [2023-11-19 07:54:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 07:54:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2023-11-19 07:54:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:13,847 INFO L225 Difference]: With dead ends: 358 [2023-11-19 07:54:13,848 INFO L226 Difference]: Without dead ends: 260 [2023-11-19 07:54:13,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2023-11-19 07:54:13,851 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 338 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:13,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 832 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-19 07:54:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-19 07:54:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 195. [2023-11-19 07:54:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2023-11-19 07:54:13,893 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 158 [2023-11-19 07:54:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:13,893 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2023-11-19 07:54:13,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.588235294117647) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2023-11-19 07:54:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:13,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:13,898 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:13,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:54:13,898 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:13,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash 620727986, now seen corresponding path program 1 times [2023-11-19 07:54:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:13,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557331574] [2023-11-19 07:54:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557331574] [2023-11-19 07:54:16,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557331574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:16,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:16,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:54:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865713783] [2023-11-19 07:54:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:16,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:54:16,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:54:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:16,761 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:18,307 INFO L93 Difference]: Finished difference Result 415 states and 586 transitions. [2023-11-19 07:54:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:54:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-19 07:54:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:18,312 INFO L225 Difference]: With dead ends: 415 [2023-11-19 07:54:18,312 INFO L226 Difference]: Without dead ends: 301 [2023-11-19 07:54:18,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-19 07:54:18,319 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 419 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:18,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 408 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-19 07:54:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-11-19 07:54:18,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 222. [2023-11-19 07:54:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.318435754189944) internal successors, (236), 179 states have internal predecessors, (236), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 316 transitions. [2023-11-19 07:54:18,375 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 316 transitions. Word has length 160 [2023-11-19 07:54:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:18,378 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 316 transitions. [2023-11-19 07:54:18,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 316 transitions. [2023-11-19 07:54:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:18,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:18,386 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:18,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:54:18,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:18,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2061476552, now seen corresponding path program 1 times [2023-11-19 07:54:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:18,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303398259] [2023-11-19 07:54:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303398259] [2023-11-19 07:54:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303398259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-19 07:54:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024684935] [2023-11-19 07:54:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 07:54:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 07:54:21,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:54:21,951 INFO L87 Difference]: Start difference. First operand 222 states and 316 transitions. Second operand has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:24,388 INFO L93 Difference]: Finished difference Result 550 states and 778 transitions. [2023-11-19 07:54:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-19 07:54:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-19 07:54:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:24,394 INFO L225 Difference]: With dead ends: 550 [2023-11-19 07:54:24,394 INFO L226 Difference]: Without dead ends: 421 [2023-11-19 07:54:24,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2023-11-19 07:54:24,397 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 537 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:24,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 655 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 07:54:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-19 07:54:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 285. [2023-11-19 07:54:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 242 states have internal predecessors, (328), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 408 transitions. [2023-11-19 07:54:24,448 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 408 transitions. Word has length 160 [2023-11-19 07:54:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:24,449 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 408 transitions. [2023-11-19 07:54:24,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 408 transitions. [2023-11-19 07:54:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:24,461 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:24,461 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:24,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:54:24,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:24,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1373416720, now seen corresponding path program 1 times [2023-11-19 07:54:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:24,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047456942] [2023-11-19 07:54:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047456942] [2023-11-19 07:54:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047456942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361063617] [2023-11-19 07:54:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:25,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:25,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:25,042 INFO L87 Difference]: Start difference. First operand 285 states and 408 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:25,390 INFO L93 Difference]: Finished difference Result 589 states and 834 transitions. [2023-11-19 07:54:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:25,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-19 07:54:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:25,395 INFO L225 Difference]: With dead ends: 589 [2023-11-19 07:54:25,395 INFO L226 Difference]: Without dead ends: 418 [2023-11-19 07:54:25,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:54:25,397 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:25,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 455 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:54:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-19 07:54:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 295. [2023-11-19 07:54:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 252 states have (on average 1.3571428571428572) internal successors, (342), 252 states have internal predecessors, (342), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 422 transitions. [2023-11-19 07:54:25,433 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 422 transitions. Word has length 160 [2023-11-19 07:54:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:25,434 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 422 transitions. [2023-11-19 07:54:25,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 422 transitions. [2023-11-19 07:54:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:25,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:25,437 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:25,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:54:25,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:25,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1641686898, now seen corresponding path program 1 times [2023-11-19 07:54:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673012439] [2023-11-19 07:54:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673012439] [2023-11-19 07:54:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673012439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:27,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:54:27,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074539519] [2023-11-19 07:54:27,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:27,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:54:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:27,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:54:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:54:27,378 INFO L87 Difference]: Start difference. First operand 295 states and 422 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:28,494 INFO L93 Difference]: Finished difference Result 624 states and 885 transitions. [2023-11-19 07:54:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:54:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-19 07:54:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:28,498 INFO L225 Difference]: With dead ends: 624 [2023-11-19 07:54:28,498 INFO L226 Difference]: Without dead ends: 443 [2023-11-19 07:54:28,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:54:28,500 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 317 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:28,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 414 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:54:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-19 07:54:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 335. [2023-11-19 07:54:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.3630136986301369) internal successors, (398), 292 states have internal predecessors, (398), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 478 transitions. [2023-11-19 07:54:28,533 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 478 transitions. Word has length 160 [2023-11-19 07:54:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:28,534 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 478 transitions. [2023-11-19 07:54:28,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 478 transitions. [2023-11-19 07:54:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:28,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:28,537 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:54:28,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:28,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2092942134, now seen corresponding path program 1 times [2023-11-19 07:54:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598904180] [2023-11-19 07:54:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598904180] [2023-11-19 07:54:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598904180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:54:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511604325] [2023-11-19 07:54:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:29,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:54:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:54:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:29,059 INFO L87 Difference]: Start difference. First operand 335 states and 478 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:29,994 INFO L93 Difference]: Finished difference Result 590 states and 837 transitions. [2023-11-19 07:54:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:54:29,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-19 07:54:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:29,998 INFO L225 Difference]: With dead ends: 590 [2023-11-19 07:54:29,998 INFO L226 Difference]: Without dead ends: 388 [2023-11-19 07:54:29,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 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:54:30,001 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 156 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:30,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 480 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-19 07:54:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-11-19 07:54:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 334. [2023-11-19 07:54:30,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 291 states have (on average 1.3608247422680413) internal successors, (396), 291 states have internal predecessors, (396), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 476 transitions. [2023-11-19 07:54:30,034 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 476 transitions. Word has length 160 [2023-11-19 07:54:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:30,038 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 476 transitions. [2023-11-19 07:54:30,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-19 07:54:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 476 transitions. [2023-11-19 07:54:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:30,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:30,041 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:30,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:54:30,044 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:30,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:30,044 INFO L85 PathProgramCache]: Analyzing trace with hash -956672302, now seen corresponding path program 1 times [2023-11-19 07:54:30,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552488724] [2023-11-19 07:54:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552488724] [2023-11-19 07:54:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552488724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:54:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002780790] [2023-11-19 07:54:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:32,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:54:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:32,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:54:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:32,101 INFO L87 Difference]: Start difference. First operand 334 states and 476 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:33,769 INFO L93 Difference]: Finished difference Result 626 states and 886 transitions. [2023-11-19 07:54:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:54:33,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-19 07:54:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:33,773 INFO L225 Difference]: With dead ends: 626 [2023-11-19 07:54:33,773 INFO L226 Difference]: Without dead ends: 425 [2023-11-19 07:54:33,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:54:33,775 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 289 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:33,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 817 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-19 07:54:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2023-11-19 07:54:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 338. [2023-11-19 07:54:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.3559322033898304) internal successors, (400), 295 states have internal predecessors, (400), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-19 07:54:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 480 transitions. [2023-11-19 07:54:33,815 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 480 transitions. Word has length 160 [2023-11-19 07:54:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:33,816 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 480 transitions. [2023-11-19 07:54:33,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 480 transitions. [2023-11-19 07:54:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-19 07:54:33,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:33,819 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:33,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:54:33,820 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:33,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 643360240, now seen corresponding path program 1 times [2023-11-19 07:54:33,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:33,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499732803] [2023-11-19 07:54:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-19 07:54:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-19 07:54:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:54:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:54:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:54:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:54:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:54:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-19 07:54:36,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:36,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499732803] [2023-11-19 07:54:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499732803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:36,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:54:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092589518] [2023-11-19 07:54:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:36,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:54:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:36,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:54:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:36,067 INFO L87 Difference]: Start difference. First operand 338 states and 480 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20)