./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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 7581e0bea1826c3794ad0449af5150018419a32379630f3feef0d64beaf17e52 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:54:04,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:54:04,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:54:04,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:54:04,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:54:04,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:54:04,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:54:04,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:54:04,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:54:04,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:54:04,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:54:04,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:54:04,352 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:54:04,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:54:04,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:54:04,369 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:54:04,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:54:04,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:54:04,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:54:04,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:54:04,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:54:04,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:54:04,373 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:54:04,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:54:04,375 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:54:04,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:54:04,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:54:04,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:54:04,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:04,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:54:04,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:54:04,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:54:04,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:54:04,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:54:04,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:54:04,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:54:04,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:54:04,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:54:04,380 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:54:04,380 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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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 -> 7581e0bea1826c3794ad0449af5150018419a32379630f3feef0d64beaf17e52 [2023-11-19 07:54:04,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:54:04,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:54:04,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:54:04,659 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:54:04,660 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:54:04,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i [2023-11-19 07:54:07,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:54:08,055 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:54:08,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i [2023-11-19 07:54:08,072 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/data/57d4fb3e9/107720bfbe9c40aea8197c1d1cc73da5/FLAGb2050e18e [2023-11-19 07:54:08,095 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/data/57d4fb3e9/107720bfbe9c40aea8197c1d1cc73da5 [2023-11-19 07:54:08,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:54:08,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:54:08,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:08,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:54:08,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:54:08,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df32ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08, skipping insertion in model container [2023-11-19 07:54:08,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:54:08,376 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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i[917,930] [2023-11-19 07:54:08,514 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:08,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:54:08,547 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_026aeaf5-23a7-4f8f-9fc7-140dda424fea/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-23.i[917,930] [2023-11-19 07:54:08,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:08,620 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:54:08,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08 WrapperNode [2023-11-19 07:54:08,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:08,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:08,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:54:08,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:54:08,632 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:54:08" (1/1) ... [2023-11-19 07:54:08,647 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:54:08" (1/1) ... [2023-11-19 07:54:08,713 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2023-11-19 07:54:08,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:08,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:54:08,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:54:08,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:54:08,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:54:08,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:54:08,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:54:08,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:54:08,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (1/1) ... [2023-11-19 07:54:08,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:54:08,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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:54:08,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026aeaf5-23a7-4f8f-9fc7-140dda424fea/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:54:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:54:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-19 07:54:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:54:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-19 07:54:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:54:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-19 07:54:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:54:08,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:54:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:54:08,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:54:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:54:09,054 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:54:09,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:54:09,758 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:54:09,768 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:54:09,768 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:54:09,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:09 BoogieIcfgContainer [2023-11-19 07:54:09,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:54:09,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:54:09,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:54:09,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:54:09,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:54:08" (1/3) ... [2023-11-19 07:54:09,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b8e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:09, skipping insertion in model container [2023-11-19 07:54:09,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:08" (2/3) ... [2023-11-19 07:54:09,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b8e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:09, skipping insertion in model container [2023-11-19 07:54:09,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:09" (3/3) ... [2023-11-19 07:54:09,783 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-23.i [2023-11-19 07:54:09,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:54:09,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:54:09,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:54:09,878 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;@32611c2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:54:09,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:54:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 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:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:09,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:09,903 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:09,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:09,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 226038208, now seen corresponding path program 1 times [2023-11-19 07:54:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897823810] [2023-11-19 07:54:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:10,504 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:10,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:10,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897823810] [2023-11-19 07:54:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897823810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:54:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042331557] [2023-11-19 07:54:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:54:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:54:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:54:10,559 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 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 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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:54:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:10,602 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2023-11-19 07:54:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:54:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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 165 [2023-11-19 07:54:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:10,614 INFO L225 Difference]: With dead ends: 241 [2023-11-19 07:54:10,615 INFO L226 Difference]: Without dead ends: 120 [2023-11-19 07:54:10,619 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:54:10,623 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:10,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-19 07:54:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-19 07:54:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 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:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-11-19 07:54:10,680 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2023-11-19 07:54:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-11-19 07:54:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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:54:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-11-19 07:54:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:10,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:10,686 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:10,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:54:10,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:10,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1467310604, now seen corresponding path program 1 times [2023-11-19 07:54:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:10,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587292139] [2023-11-19 07:54:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:14,771 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:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587292139] [2023-11-19 07:54:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587292139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:54:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044854647] [2023-11-19 07:54:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:14,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:54:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:54:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:14,777 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:16,642 INFO L93 Difference]: Finished difference Result 347 states and 510 transitions. [2023-11-19 07:54:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:54:16,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-19 07:54:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:16,649 INFO L225 Difference]: With dead ends: 347 [2023-11-19 07:54:16,651 INFO L226 Difference]: Without dead ends: 230 [2023-11-19 07:54:16,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2023-11-19 07:54:16,658 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 588 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:16,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 970 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:54:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-19 07:54:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 135. [2023-11-19 07:54:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.407079646017699) internal successors, (159), 113 states have internal predecessors, (159), 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:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2023-11-19 07:54:16,710 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 165 [2023-11-19 07:54:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:16,713 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2023-11-19 07:54:16,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2023-11-19 07:54:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:16,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:16,724 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:16,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:54:16,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:16,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash 880504590, now seen corresponding path program 1 times [2023-11-19 07:54:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984087995] [2023-11-19 07:54:16,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:19,465 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:19,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:19,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984087995] [2023-11-19 07:54:19,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984087995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:54:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754641624] [2023-11-19 07:54:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:54:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:54:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:54:19,471 INFO L87 Difference]: Start difference. First operand 135 states and 199 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:20,499 INFO L93 Difference]: Finished difference Result 333 states and 492 transitions. [2023-11-19 07:54:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:54:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 165 [2023-11-19 07:54:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:20,505 INFO L225 Difference]: With dead ends: 333 [2023-11-19 07:54:20,508 INFO L226 Difference]: Without dead ends: 201 [2023-11-19 07:54:20,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:20,512 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 345 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:20,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 648 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:54:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-11-19 07:54:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 144. [2023-11-19 07:54:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.4098360655737705) internal successors, (172), 122 states have internal predecessors, (172), 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:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2023-11-19 07:54:20,565 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 165 [2023-11-19 07:54:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:20,570 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2023-11-19 07:54:20,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2023-11-19 07:54:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:20,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:20,576 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:54:20,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:20,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 649662154, now seen corresponding path program 1 times [2023-11-19 07:54:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948964126] [2023-11-19 07:54:20,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:22,635 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:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948964126] [2023-11-19 07:54:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948964126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:54:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54495468] [2023-11-19 07:54:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:22,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:54:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:54:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:22,642 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:23,596 INFO L93 Difference]: Finished difference Result 318 states and 467 transitions. [2023-11-19 07:54:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:54:23,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 165 [2023-11-19 07:54:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:23,601 INFO L225 Difference]: With dead ends: 318 [2023-11-19 07:54:23,601 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 07:54:23,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:54:23,608 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 281 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:23,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 938 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:54:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 07:54:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2023-11-19 07:54:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 113 states have internal predecessors, (158), 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:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2023-11-19 07:54:23,640 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 165 [2023-11-19 07:54:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:23,641 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2023-11-19 07:54:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2023-11-19 07:54:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:23,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:23,644 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:54:23,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:23,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1333297098, now seen corresponding path program 1 times [2023-11-19 07:54:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:23,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356504630] [2023-11-19 07:54:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:26,255 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:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:26,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356504630] [2023-11-19 07:54:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356504630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:26,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:54:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322509202] [2023-11-19 07:54:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:54:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:54:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:54:26,261 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:27,385 INFO L93 Difference]: Finished difference Result 335 states and 493 transitions. [2023-11-19 07:54:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:54:27,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-19 07:54:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:27,389 INFO L225 Difference]: With dead ends: 335 [2023-11-19 07:54:27,389 INFO L226 Difference]: Without dead ends: 203 [2023-11-19 07:54:27,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:54:27,391 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 520 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:27,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 529 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:54:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-19 07:54:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 146. [2023-11-19 07:54:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 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:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 215 transitions. [2023-11-19 07:54:27,419 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 215 transitions. Word has length 165 [2023-11-19 07:54:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:27,420 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 215 transitions. [2023-11-19 07:54:27,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 215 transitions. [2023-11-19 07:54:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-19 07:54:27,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:27,424 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, 1, 1, 1, 1, 1] [2023-11-19 07:54:27,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:54:27,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:27,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash 746491084, now seen corresponding path program 1 times [2023-11-19 07:54:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064212845] [2023-11-19 07:54:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:28,961 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 23 [2023-11-19 07:54:28,968 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,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:29,003 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 65 [2023-11-19 07:54:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:29,037 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 92 [2023-11-19 07:54:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:29,136 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,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064212845] [2023-11-19 07:54:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064212845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:29,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-19 07:54:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144749920] [2023-11-19 07:54:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:29,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 07:54:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:29,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 07:54:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:54:29,139 INFO L87 Difference]: Start difference. First operand 146 states and 215 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:30,198 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2023-11-19 07:54:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:54:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-19 07:54:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:30,202 INFO L225 Difference]: With dead ends: 322 [2023-11-19 07:54:30,202 INFO L226 Difference]: Without dead ends: 179 [2023-11-19 07:54:30,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-11-19 07:54:30,206 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 305 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:30,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 978 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 07:54:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-19 07:54:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 146. [2023-11-19 07:54:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 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:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 215 transitions. [2023-11-19 07:54:30,232 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 215 transitions. Word has length 165 [2023-11-19 07:54:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:30,233 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 215 transitions. [2023-11-19 07:54:30,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 215 transitions. [2023-11-19 07:54:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:30,237 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:30,237 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:30,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:54:30,238 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:30,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:30,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1232715426, now seen corresponding path program 1 times [2023-11-19 07:54:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241700246] [2023-11-19 07:54:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:30,579 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:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241700246] [2023-11-19 07:54:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241700246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:30,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:54:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342020912] [2023-11-19 07:54:30,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:30,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:54:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:54:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:54:30,583 INFO L87 Difference]: Start difference. First operand 146 states and 215 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:30,662 INFO L93 Difference]: Finished difference Result 308 states and 455 transitions. [2023-11-19 07:54:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:54:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 167 [2023-11-19 07:54:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:30,667 INFO L225 Difference]: With dead ends: 308 [2023-11-19 07:54:30,667 INFO L226 Difference]: Without dead ends: 165 [2023-11-19 07:54:30,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:54:30,669 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 711 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:54:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-19 07:54:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2023-11-19 07:54:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 127 states have internal predecessors, (178), 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:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2023-11-19 07:54:30,701 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 167 [2023-11-19 07:54:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2023-11-19 07:54:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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,702 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2023-11-19 07:54:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:30,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:30,705 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:30,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:54:30,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:30,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1282045889, now seen corresponding path program 1 times [2023-11-19 07:54:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771542202] [2023-11-19 07:54:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:33,005 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:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771542202] [2023-11-19 07:54:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771542202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 07:54:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223504361] [2023-11-19 07:54:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:54:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:54:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:54:33,008 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:34,310 INFO L93 Difference]: Finished difference Result 362 states and 526 transitions. [2023-11-19 07:54:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:54:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2023-11-19 07:54:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:34,313 INFO L225 Difference]: With dead ends: 362 [2023-11-19 07:54:34,313 INFO L226 Difference]: Without dead ends: 216 [2023-11-19 07:54:34,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:54:34,315 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 639 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:34,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 990 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:54:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-19 07:54:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2023-11-19 07:54:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 129 states have internal predecessors, (181), 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:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2023-11-19 07:54:34,338 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 167 [2023-11-19 07:54:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:34,338 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2023-11-19 07:54:34,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 07:54:34,339 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2023-11-19 07:54:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:34,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:34,342 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:34,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:54:34,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:34,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 695239875, now seen corresponding path program 1 times [2023-11-19 07:54:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:34,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234313593] [2023-11-19 07:54:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:36,430 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,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234313593] [2023-11-19 07:54:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234313593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:36,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-19 07:54:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761009707] [2023-11-19 07:54:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:36,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:54:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:36,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:54:36,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:54:36,435 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:37,618 INFO L93 Difference]: Finished difference Result 362 states and 526 transitions. [2023-11-19 07:54:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:54:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2023-11-19 07:54:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:37,621 INFO L225 Difference]: With dead ends: 362 [2023-11-19 07:54:37,622 INFO L226 Difference]: Without dead ends: 214 [2023-11-19 07:54:37,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-11-19 07:54:37,623 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 415 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:37,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 687 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:54:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-19 07:54:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 149. [2023-11-19 07:54:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 127 states have internal predecessors, (178), 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:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2023-11-19 07:54:37,645 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 167 [2023-11-19 07:54:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:37,646 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2023-11-19 07:54:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2023-11-19 07:54:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:37,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:37,649 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:37,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:54:37,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:37,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:37,650 INFO L85 PathProgramCache]: Analyzing trace with hash 732348977, now seen corresponding path program 1 times [2023-11-19 07:54:37,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840854442] [2023-11-19 07:54:37,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:39,952 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:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840854442] [2023-11-19 07:54:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840854442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 07:54:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437745791] [2023-11-19 07:54:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:39,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 07:54:39,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:39,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:54:39,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:54:39,956 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:41,316 INFO L93 Difference]: Finished difference Result 373 states and 543 transitions. [2023-11-19 07:54:41,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:54:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2023-11-19 07:54:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:41,319 INFO L225 Difference]: With dead ends: 373 [2023-11-19 07:54:41,320 INFO L226 Difference]: Without dead ends: 227 [2023-11-19 07:54:41,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2023-11-19 07:54:41,321 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 563 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:41,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 886 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:54:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-19 07:54:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 162. [2023-11-19 07:54:41,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4214285714285715) internal successors, (199), 140 states have internal predecessors, (199), 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:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 239 transitions. [2023-11-19 07:54:41,348 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 239 transitions. Word has length 167 [2023-11-19 07:54:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:41,349 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 239 transitions. [2023-11-19 07:54:41,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 239 transitions. [2023-11-19 07:54:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:41,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:41,353 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:54:41,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:41,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 145542963, now seen corresponding path program 1 times [2023-11-19 07:54:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:41,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069450520] [2023-11-19 07:54:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:43,904 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:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069450520] [2023-11-19 07:54:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069450520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:43,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-19 07:54:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822925280] [2023-11-19 07:54:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-19 07:54:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:43,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-19 07:54:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-19 07:54:43,908 INFO L87 Difference]: Start difference. First operand 162 states and 239 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:54:45,920 INFO L93 Difference]: Finished difference Result 464 states and 680 transitions. [2023-11-19 07:54:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:54:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 167 [2023-11-19 07:54:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:54:45,928 INFO L225 Difference]: With dead ends: 464 [2023-11-19 07:54:45,928 INFO L226 Difference]: Without dead ends: 305 [2023-11-19 07:54:45,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:54:45,930 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 498 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:54:45,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1098 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-19 07:54:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-19 07:54:45,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 184. [2023-11-19 07:54:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 162 states have internal predecessors, (233), 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:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 273 transitions. [2023-11-19 07:54:45,959 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 273 transitions. Word has length 167 [2023-11-19 07:54:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:54:45,960 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 273 transitions. [2023-11-19 07:54:45,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-19 07:54:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 273 transitions. [2023-11-19 07:54:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-19 07:54:45,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:54:45,963 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:45,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:54:45,964 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:54:45,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1659895371, now seen corresponding path program 1 times [2023-11-19 07:54:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266079784] [2023-11-19 07:54:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:54:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-19 07:54:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-19 07:54:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:54:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:54:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-19 07:54:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:54:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-19 07:54:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 07:54:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:54:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-19 07:54:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-19 07:54:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:54:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-19 07:54:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-19 07:54:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-19 07:54:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-19 07:54:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:54:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-19 07:54:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-19 07:54:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:47,392 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:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266079784] [2023-11-19 07:54:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266079784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:47,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:47,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:54:47,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693868635] [2023-11-19 07:54:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:47,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:54:47,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:54:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:54:47,396 INFO L87 Difference]: Start difference. First operand 184 states and 273 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)