./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU --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 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:41,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:41,306 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:00:41,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:41,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:41,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:41,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:41,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:41,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:41,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:41,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:41,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:41,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:41,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:41,367 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:41,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:41,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:41,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:41,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:00:41,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:41,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:41,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:41,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:41,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:41,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:41,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:41,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:41,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:41,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:41,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:41,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:41,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:41,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:41,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:41,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:41,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:41,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:00:41,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:00:41,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:41,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:41,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:41,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:41,383 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_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/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_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2024-10-31 22:00:41,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:41,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:41,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:41,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:41,755 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:41,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i Unable to find full path for "g++" [2024-10-31 22:00:43,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:44,126 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:44,126 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2024-10-31 22:00:44,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/data/ba6c6edcd/7fcc2ae87b92468994303a3966ef1fdb/FLAGb31b5d5ba [2024-10-31 22:00:44,147 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/data/ba6c6edcd/7fcc2ae87b92468994303a3966ef1fdb [2024-10-31 22:00:44,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:44,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:44,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:44,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:44,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:44,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6b268f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44, skipping insertion in model container [2024-10-31 22:00:44,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:44,379 WARN L251 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_357fa1a4-458e-405f-bbba-e328ba214a6c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-31 22:00:44,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:44,493 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:44,509 WARN L251 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_357fa1a4-458e-405f-bbba-e328ba214a6c/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i[916,929] [2024-10-31 22:00:44,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:44,598 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:44,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44 WrapperNode [2024-10-31 22:00:44,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:44,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:44,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:44,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:44,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,711 INFO L138 Inliner]: procedures = 30, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 469 [2024-10-31 22:00:44,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:44,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:44,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:44,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:44,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,753 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-31 22:00:44,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:44,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:44,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:44,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:44,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (1/1) ... [2024-10-31 22:00:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:44,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:44,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:44,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_357fa1a4-458e-405f-bbba-e328ba214a6c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-10-31 22:00:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-10-31 22:00:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:00:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-10-31 22:00:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-10-31 22:00:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:00:44,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:44,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:00:44,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:44,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:44,978 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:44,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:45,843 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:45,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:45,874 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:45,875 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:45,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:45 BoogieIcfgContainer [2024-10-31 22:00:45,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:45,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:45,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:45,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:45,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:44" (1/3) ... [2024-10-31 22:00:45,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b606e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:45, skipping insertion in model container [2024-10-31 22:00:45,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:44" (2/3) ... [2024-10-31 22:00:45,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b606e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:45, skipping insertion in model container [2024-10-31 22:00:45,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:45" (3/3) ... [2024-10-31 22:00:45,891 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2024-10-31 22:00:45,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:45,918 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:46,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:46,020 INFO L333 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, 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;@16fb9fbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:46,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:00:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-31 22:00:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:46,039 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:46,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:46,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1817616766, now seen corresponding path program 1 times [2024-10-31 22:00:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302059386] [2024-10-31 22:00:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:47,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302059386] [2024-10-31 22:00:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302059386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474980293] [2024-10-31 22:00:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:47,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:47,134 INFO L87 Difference]: Start difference. First operand has 112 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:47,239 INFO L93 Difference]: Finished difference Result 219 states and 344 transitions. [2024-10-31 22:00:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-31 22:00:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:47,255 INFO L225 Difference]: With dead ends: 219 [2024-10-31 22:00:47,255 INFO L226 Difference]: Without dead ends: 110 [2024-10-31 22:00:47,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:47,265 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:47,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-31 22:00:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-31 22:00:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:00:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2024-10-31 22:00:47,334 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2024-10-31 22:00:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2024-10-31 22:00:47,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2024-10-31 22:00:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-31 22:00:47,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:47,345 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:47,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:00:47,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:47,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 210969344, now seen corresponding path program 1 times [2024-10-31 22:00:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897292938] [2024-10-31 22:00:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:47,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897292938] [2024-10-31 22:00:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897292938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:47,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:47,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989127451] [2024-10-31 22:00:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:47,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:47,885 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:47,951 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2024-10-31 22:00:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:47,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-10-31 22:00:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:47,960 INFO L225 Difference]: With dead ends: 219 [2024-10-31 22:00:47,960 INFO L226 Difference]: Without dead ends: 112 [2024-10-31 22:00:47,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:47,962 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:47,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-31 22:00:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-31 22:00:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:00:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2024-10-31 22:00:47,976 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 131 [2024-10-31 22:00:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2024-10-31 22:00:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2024-10-31 22:00:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:00:47,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:47,980 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:47,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:00:47,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash 466550713, now seen corresponding path program 1 times [2024-10-31 22:00:47,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661378988] [2024-10-31 22:00:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661378988] [2024-10-31 22:00:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661378988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:50,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:50,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:00:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509928523] [2024-10-31 22:00:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:50,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:00:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:50,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:00:50,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:00:50,337 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:50,827 INFO L93 Difference]: Finished difference Result 330 states and 483 transitions. [2024-10-31 22:00:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-31 22:00:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:50,831 INFO L225 Difference]: With dead ends: 330 [2024-10-31 22:00:50,831 INFO L226 Difference]: Without dead ends: 221 [2024-10-31 22:00:50,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:00:50,834 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 101 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:50,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 269 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:00:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-31 22:00:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2024-10-31 22:00:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:00:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 318 transitions. [2024-10-31 22:00:50,871 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 318 transitions. Word has length 133 [2024-10-31 22:00:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:50,872 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 318 transitions. [2024-10-31 22:00:50,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 318 transitions. [2024-10-31 22:00:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:00:50,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:50,878 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:00:50,879 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -351097737, now seen corresponding path program 1 times [2024-10-31 22:00:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508196797] [2024-10-31 22:00:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508196797] [2024-10-31 22:00:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508196797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:53,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:00:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965475061] [2024-10-31 22:00:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:00:53,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:00:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:00:53,069 INFO L87 Difference]: Start difference. First operand 217 states and 318 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:53,588 INFO L93 Difference]: Finished difference Result 479 states and 702 transitions. [2024-10-31 22:00:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:00:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-10-31 22:00:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:53,594 INFO L225 Difference]: With dead ends: 479 [2024-10-31 22:00:53,594 INFO L226 Difference]: Without dead ends: 265 [2024-10-31 22:00:53,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:00:53,600 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 114 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:53,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 424 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:00:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-31 22:00:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 222. [2024-10-31 22:00:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 189 states have internal predecessors, (264), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:00:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 324 transitions. [2024-10-31 22:00:53,643 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 324 transitions. Word has length 133 [2024-10-31 22:00:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:53,648 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 324 transitions. [2024-10-31 22:00:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 324 transitions. [2024-10-31 22:00:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-31 22:00:53,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:53,654 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:53,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:00:53,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1939445639, now seen corresponding path program 1 times [2024-10-31 22:00:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970583043] [2024-10-31 22:00:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970583043] [2024-10-31 22:00:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970583043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:00:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21106750] [2024-10-31 22:00:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:54,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:00:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:00:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:00:54,106 INFO L87 Difference]: Start difference. First operand 222 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:54,456 INFO L93 Difference]: Finished difference Result 474 states and 691 transitions. [2024-10-31 22:00:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:00:54,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2024-10-31 22:00:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:54,459 INFO L225 Difference]: With dead ends: 474 [2024-10-31 22:00:54,459 INFO L226 Difference]: Without dead ends: 255 [2024-10-31 22:00:54,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:00:54,462 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 95 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:54,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 352 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:00:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-31 22:00:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 224. [2024-10-31 22:00:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 191 states have internal predecessors, (266), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:00:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 326 transitions. [2024-10-31 22:00:54,489 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 326 transitions. Word has length 133 [2024-10-31 22:00:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:54,491 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 326 transitions. [2024-10-31 22:00:54,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 326 transitions. [2024-10-31 22:00:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:00:54,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:54,498 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:54,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:00:54,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -725381655, now seen corresponding path program 1 times [2024-10-31 22:00:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229910055] [2024-10-31 22:00:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229910055] [2024-10-31 22:00:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229910055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:00:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087420737] [2024-10-31 22:00:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:55,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:00:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:00:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:00:55,045 INFO L87 Difference]: Start difference. First operand 224 states and 326 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:55,512 INFO L93 Difference]: Finished difference Result 567 states and 819 transitions. [2024-10-31 22:00:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:00:55,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-31 22:00:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:55,515 INFO L225 Difference]: With dead ends: 567 [2024-10-31 22:00:55,515 INFO L226 Difference]: Without dead ends: 346 [2024-10-31 22:00:55,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:00:55,519 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 67 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:55,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 647 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:00:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-31 22:00:55,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2024-10-31 22:00:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 297 states have (on average 1.3838383838383839) internal successors, (411), 299 states have internal predecessors, (411), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:00:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 491 transitions. [2024-10-31 22:00:55,558 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 491 transitions. Word has length 134 [2024-10-31 22:00:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 491 transitions. [2024-10-31 22:00:55,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 491 transitions. [2024-10-31 22:00:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:00:55,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:55,563 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:00:55,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1118408665, now seen corresponding path program 1 times [2024-10-31 22:00:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806137767] [2024-10-31 22:00:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:55,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806137767] [2024-10-31 22:00:55,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806137767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:55,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:00:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602163032] [2024-10-31 22:00:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:55,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:00:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:55,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:00:55,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:00:55,722 INFO L87 Difference]: Start difference. First operand 342 states and 491 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:55,753 INFO L93 Difference]: Finished difference Result 685 states and 987 transitions. [2024-10-31 22:00:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:00:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-31 22:00:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:55,759 INFO L225 Difference]: With dead ends: 685 [2024-10-31 22:00:55,760 INFO L226 Difference]: Without dead ends: 346 [2024-10-31 22:00:55,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:00:55,763 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:55,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-31 22:00:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-10-31 22:00:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 301 states have (on average 1.3787375415282392) internal successors, (415), 303 states have internal predecessors, (415), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-31 22:00:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 495 transitions. [2024-10-31 22:00:55,789 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 495 transitions. Word has length 134 [2024-10-31 22:00:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 495 transitions. [2024-10-31 22:00:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 495 transitions. [2024-10-31 22:00:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:00:55,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:55,792 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:00:55,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -417344087, now seen corresponding path program 1 times [2024-10-31 22:00:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985328479] [2024-10-31 22:00:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:00:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:00:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:00:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:00:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:00:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:00:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:00:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:00:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:00:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:00:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:00:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:00:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:00:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:58,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985328479] [2024-10-31 22:00:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985328479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:00:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870096984] [2024-10-31 22:00:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:00:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:00:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:00:58,006 INFO L87 Difference]: Start difference. First operand 346 states and 495 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:59,868 INFO L93 Difference]: Finished difference Result 1099 states and 1569 transitions. [2024-10-31 22:00:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:00:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-10-31 22:00:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:59,874 INFO L225 Difference]: With dead ends: 1099 [2024-10-31 22:00:59,874 INFO L226 Difference]: Without dead ends: 756 [2024-10-31 22:00:59,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:00:59,876 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 251 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:59,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 973 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-31 22:00:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-31 22:00:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 747. [2024-10-31 22:00:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 654 states have (on average 1.382262996941896) internal successors, (904), 659 states have internal predecessors, (904), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-31 22:00:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1068 transitions. [2024-10-31 22:00:59,936 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1068 transitions. Word has length 134 [2024-10-31 22:00:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:59,937 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1068 transitions. [2024-10-31 22:00:59,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1068 transitions. [2024-10-31 22:00:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:00:59,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:59,940 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:59,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:00:59,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1543030105, now seen corresponding path program 1 times [2024-10-31 22:00:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:59,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708657397] [2024-10-31 22:00:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:01:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:01:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:01:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:01:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:01:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:01:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:01:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:01:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:01:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:01:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:01:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:01:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:01:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:01,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:01:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708657397] [2024-10-31 22:01:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708657397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:01:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067347602] [2024-10-31 22:01:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:01,570 INFO L87 Difference]: Start difference. First operand 747 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:01:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:01,932 INFO L93 Difference]: Finished difference Result 1494 states and 2137 transitions. [2024-10-31 22:01:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-31 22:01:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:01,938 INFO L225 Difference]: With dead ends: 1494 [2024-10-31 22:01:01,938 INFO L226 Difference]: Without dead ends: 750 [2024-10-31 22:01:01,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:01:01,941 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 85 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:01,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:01:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-31 22:01:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 744. [2024-10-31 22:01:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 651 states have (on average 1.3778801843317972) internal successors, (897), 656 states have internal predecessors, (897), 82 states have call successors, (82), 10 states have call predecessors, (82), 10 states have return successors, (82), 77 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-31 22:01:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1061 transitions. [2024-10-31 22:01:01,994 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1061 transitions. Word has length 134 [2024-10-31 22:01:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:01,995 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1061 transitions. [2024-10-31 22:01:01,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:01:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1061 transitions. [2024-10-31 22:01:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:01:01,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:01,998 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:01:01,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:01,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash -841965527, now seen corresponding path program 1 times [2024-10-31 22:01:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586538735] [2024-10-31 22:01:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:01:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:01:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:01:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:01:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:01:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:01:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:01:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:01:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:01:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:01:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:01:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:01:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:01:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:01:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586538735] [2024-10-31 22:01:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586538735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:01:04,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196241074] [2024-10-31 22:01:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:01:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:01:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:04,021 INFO L87 Difference]: Start difference. First operand 744 states and 1061 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:01:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:05,725 INFO L93 Difference]: Finished difference Result 1170 states and 1653 transitions. [2024-10-31 22:01:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:01:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-10-31 22:01:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:05,731 INFO L225 Difference]: With dead ends: 1170 [2024-10-31 22:01:05,731 INFO L226 Difference]: Without dead ends: 768 [2024-10-31 22:01:05,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:01:05,733 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 274 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:05,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 892 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-31 22:01:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-31 22:01:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 761. [2024-10-31 22:01:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 663 states have (on average 1.368024132730015) internal successors, (907), 669 states have internal predecessors, (907), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-31 22:01:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1075 transitions. [2024-10-31 22:01:05,797 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1075 transitions. Word has length 134 [2024-10-31 22:01:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1075 transitions. [2024-10-31 22:01:05,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:01:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1075 transitions. [2024-10-31 22:01:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:01:05,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:05,801 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:05,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:01:05,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1234992537, now seen corresponding path program 1 times [2024-10-31 22:01:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:05,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44238024] [2024-10-31 22:01:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:05,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:01:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:01:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:01:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:01:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:01:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:01:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:01:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:01:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:01:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:01:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:01:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:01:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:01:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:01:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44238024] [2024-10-31 22:01:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44238024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:06,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:01:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503517958] [2024-10-31 22:01:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:01:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:01:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:06,285 INFO L87 Difference]: Start difference. First operand 761 states and 1075 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:01:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:07,078 INFO L93 Difference]: Finished difference Result 1759 states and 2501 transitions. [2024-10-31 22:01:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:01:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2024-10-31 22:01:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:01:07,089 INFO L225 Difference]: With dead ends: 1759 [2024-10-31 22:01:07,089 INFO L226 Difference]: Without dead ends: 1010 [2024-10-31 22:01:07,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:01:07,092 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 135 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:01:07,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1741 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:01:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-10-31 22:01:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 960. [2024-10-31 22:01:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 815 states have (on average 1.3570552147239263) internal successors, (1106), 821 states have internal predecessors, (1106), 127 states have call successors, (127), 17 states have call predecessors, (127), 17 states have return successors, (127), 121 states have call predecessors, (127), 127 states have call successors, (127) [2024-10-31 22:01:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1360 transitions. [2024-10-31 22:01:07,158 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1360 transitions. Word has length 134 [2024-10-31 22:01:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:01:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1360 transitions. [2024-10-31 22:01:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:01:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1360 transitions. [2024-10-31 22:01:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-31 22:01:07,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:01:07,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:07,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:01:07,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:01:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash -276795477, now seen corresponding path program 1 times [2024-10-31 22:01:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:07,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399778626] [2024-10-31 22:01:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:01:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:01:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:01:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:01:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:01:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:01:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:01:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:01:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:01:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:01:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:01:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:01:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:01:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:01:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:01:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:01:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399778626] [2024-10-31 22:01:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399778626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:01:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376692881] [2024-10-31 22:01:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:01:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:01:09,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:01:09,669 INFO L87 Difference]: Start difference. First operand 960 states and 1360 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)