./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:17:15,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:17:15,968 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:17:15,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:17:15,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:17:16,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:17:16,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:17:16,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:17:16,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:17:16,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:17:16,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:17:16,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:17:16,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:17:16,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:17:16,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:17:16,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:17:16,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:17:16,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:17:16,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:17:16,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:17:16,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:17:16,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:17:16,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:17:16,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:17:16,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:17:16,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:17:16,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:17:16,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:17:16,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:17:16,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:17:16,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:17:16,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:17:16,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:16,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:17:16,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:17:16,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:17:16,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:17:16,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:17:16,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:17:16,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:17:16,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:17:16,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:17:16,042 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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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 -> 1d35048482bec5585a23759f57e0e5f27fb64289f87c796a48314ffe6a1f4ee7 [2024-10-31 22:17:16,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:17:16,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:17:16,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:17:16,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:17:16,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:17:16,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i Unable to find full path for "g++" [2024-10-31 22:17:18,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:17:18,666 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:17:18,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i [2024-10-31 22:17:18,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/data/c3fefe5be/625871ab19e24b29bf1cd1186b434cb1/FLAG37115a237 [2024-10-31 22:17:18,699 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/data/c3fefe5be/625871ab19e24b29bf1cd1186b434cb1 [2024-10-31 22:17:18,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:17:18,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:17:18,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:18,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:17:18,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:17:18,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3443ae19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:18, skipping insertion in model container [2024-10-31 22:17:18,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:17:18" (1/1) ... [2024-10-31 22:17:18,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:17:19,027 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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-10-31 22:17:19,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:19,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:17:19,180 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_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-79.i[917,930] [2024-10-31 22:17:19,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:17:19,269 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:17:19,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19 WrapperNode [2024-10-31 22:17:19,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:17:19,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:19,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:17:19,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:17:19,284 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:17:19" (1/1) ... [2024-10-31 22:17:19,310 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:17:19" (1/1) ... [2024-10-31 22:17:19,377 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-10-31 22:17:19,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:17:19,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:17:19,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:17:19,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:17:19,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,407 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-10-31 22:17:19,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:17:19,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:17:19,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:17:19,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:17:19,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (1/1) ... [2024-10-31 22:17:19,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:17:19,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:17:19,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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:17:19,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1331e38-f9b9-4ba5-aa0b-8b8e74c2ff19/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:17:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:17:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-10-31 22:17:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-10-31 22:17:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:17:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-10-31 22:17:19,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-10-31 22:17:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:17:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:17:19,550 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:17:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:17:19,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:17:19,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:17:19,746 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:17:19,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:17:20,396 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-31 22:17:20,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:17:20,421 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:17:20,423 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:17:20,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:20 BoogieIcfgContainer [2024-10-31 22:17:20,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:17:20,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:17:20,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:17:20,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:17:20,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:17:18" (1/3) ... [2024-10-31 22:17:20,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568892fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:20, skipping insertion in model container [2024-10-31 22:17:20,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:17:19" (2/3) ... [2024-10-31 22:17:20,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568892fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:17:20, skipping insertion in model container [2024-10-31 22:17:20,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:17:20" (3/3) ... [2024-10-31 22:17:20,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-79.i [2024-10-31 22:17:20,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:17:20,469 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:17:20,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:17:20,545 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;@139eb86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:17:20,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:17:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-31 22:17:20,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:20,569 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:20,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1966256137, now seen corresponding path program 1 times [2024-10-31 22:17:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:20,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611383693] [2024-10-31 22:17:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611383693] [2024-10-31 22:17:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611383693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:21,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:21,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:17:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034350159] [2024-10-31 22:17:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:21,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:17:21,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:21,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:17:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:21,250 INFO L87 Difference]: Start difference. First operand has 95 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:21,286 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2024-10-31 22:17:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:17:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-31 22:17:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:21,301 INFO L225 Difference]: With dead ends: 183 [2024-10-31 22:17:21,302 INFO L226 Difference]: Without dead ends: 91 [2024-10-31 22:17:21,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:17:21,313 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:21,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-31 22:17:21,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-31 22:17:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-10-31 22:17:21,387 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2024-10-31 22:17:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:21,391 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-10-31 22:17:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-10-31 22:17:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-31 22:17:21,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:21,399 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:17:21,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:21,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1580299313, now seen corresponding path program 1 times [2024-10-31 22:17:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060975109] [2024-10-31 22:17:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060975109] [2024-10-31 22:17:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060975109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763330335] [2024-10-31 22:17:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:22,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:22,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:22,003 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:22,049 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-10-31 22:17:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-31 22:17:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:22,052 INFO L225 Difference]: With dead ends: 181 [2024-10-31 22:17:22,052 INFO L226 Difference]: Without dead ends: 93 [2024-10-31 22:17:22,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:17:22,054 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 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:17:22,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-31 22:17:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-31 22:17:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-10-31 22:17:22,070 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2024-10-31 22:17:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:22,075 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-10-31 22:17:22,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-10-31 22:17:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-31 22:17:22,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:22,080 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:17:22,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:22,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1378475379, now seen corresponding path program 1 times [2024-10-31 22:17:22,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:22,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432288748] [2024-10-31 22:17:22,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432288748] [2024-10-31 22:17:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432288748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:22,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:22,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:22,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720080642] [2024-10-31 22:17:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:22,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:22,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:22,515 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:22,571 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2024-10-31 22:17:22,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:22,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-31 22:17:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:22,578 INFO L225 Difference]: With dead ends: 185 [2024-10-31 22:17:22,578 INFO L226 Difference]: Without dead ends: 95 [2024-10-31 22:17:22,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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:17:22,583 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 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:17:22,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:17:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-31 22:17:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 22:17:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-10-31 22:17:22,595 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2024-10-31 22:17:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:22,596 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-10-31 22:17:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-10-31 22:17:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-31 22:17:22,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:22,598 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:17:22,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -85394738, now seen corresponding path program 1 times [2024-10-31 22:17:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826965013] [2024-10-31 22:17:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826965013] [2024-10-31 22:17:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826965013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:17:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645720536] [2024-10-31 22:17:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:23,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:17:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:17:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:17:23,082 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:23,411 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2024-10-31 22:17:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:17:23,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-31 22:17:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:23,414 INFO L225 Difference]: With dead ends: 215 [2024-10-31 22:17:23,414 INFO L226 Difference]: Without dead ends: 123 [2024-10-31 22:17:23,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:17:23,416 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:23,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 450 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:17:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-31 22:17:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2024-10-31 22:17:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-10-31 22:17:23,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 103 [2024-10-31 22:17:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-10-31 22:17:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-10-31 22:17:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:17:23,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:23,438 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:17:23,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:23,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1495965032, now seen corresponding path program 1 times [2024-10-31 22:17:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526666724] [2024-10-31 22:17:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526666724] [2024-10-31 22:17:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526666724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-31 22:17:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103100109] [2024-10-31 22:17:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-31 22:17:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:27,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-31 22:17:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:17:27,896 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:29,792 INFO L93 Difference]: Finished difference Result 369 states and 521 transitions. [2024-10-31 22:17:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 22:17:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-31 22:17:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:29,796 INFO L225 Difference]: With dead ends: 369 [2024-10-31 22:17:29,796 INFO L226 Difference]: Without dead ends: 275 [2024-10-31 22:17:29,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2024-10-31 22:17:29,821 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 369 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:29,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 797 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:17:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-31 22:17:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 157. [2024-10-31 22:17:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 22:17:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-10-31 22:17:29,846 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 104 [2024-10-31 22:17:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:29,846 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-10-31 22:17:29,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-10-31 22:17:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:17:29,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:29,852 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:29,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:17:29,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:29,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1767514722, now seen corresponding path program 1 times [2024-10-31 22:17:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298746114] [2024-10-31 22:17:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298746114] [2024-10-31 22:17:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298746114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:30,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:17:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125240443] [2024-10-31 22:17:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:30,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:17:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:17:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:17:30,595 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:31,127 INFO L93 Difference]: Finished difference Result 275 states and 395 transitions. [2024-10-31 22:17:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:17:31,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-31 22:17:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:31,133 INFO L225 Difference]: With dead ends: 275 [2024-10-31 22:17:31,133 INFO L226 Difference]: Without dead ends: 181 [2024-10-31 22:17:31,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:17:31,135 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:31,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 465 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:17:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-31 22:17:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2024-10-31 22:17:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 146 states have (on average 1.3904109589041096) internal successors, (203), 146 states have internal predecessors, (203), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 22:17:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2024-10-31 22:17:31,170 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 105 [2024-10-31 22:17:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2024-10-31 22:17:31,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2024-10-31 22:17:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:17:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:31,174 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:31,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:17:31,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:31,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 533307868, now seen corresponding path program 1 times [2024-10-31 22:17:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150110900] [2024-10-31 22:17:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150110900] [2024-10-31 22:17:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150110900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-31 22:17:33,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139812251] [2024-10-31 22:17:33,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:33,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:17:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:17:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:17:33,191 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:34,748 INFO L93 Difference]: Finished difference Result 405 states and 576 transitions. [2024-10-31 22:17:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-31 22:17:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-31 22:17:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:34,752 INFO L225 Difference]: With dead ends: 405 [2024-10-31 22:17:34,756 INFO L226 Difference]: Without dead ends: 303 [2024-10-31 22:17:34,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-10-31 22:17:34,758 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 409 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:34,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 763 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:17:34,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-31 22:17:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-10-31 22:17:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 22:17:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-10-31 22:17:34,802 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 105 [2024-10-31 22:17:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:34,803 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-10-31 22:17:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-10-31 22:17:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:17:34,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:34,806 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:17:34,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:34,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1424201366, now seen corresponding path program 1 times [2024-10-31 22:17:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988267800] [2024-10-31 22:17:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988267800] [2024-10-31 22:17:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988267800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:17:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337120577] [2024-10-31 22:17:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:17:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:17:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:36,901 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:37,868 INFO L93 Difference]: Finished difference Result 312 states and 446 transitions. [2024-10-31 22:17:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-31 22:17:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:37,871 INFO L225 Difference]: With dead ends: 312 [2024-10-31 22:17:37,871 INFO L226 Difference]: Without dead ends: 210 [2024-10-31 22:17:37,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:17:37,872 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 248 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:37,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 467 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:17:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-31 22:17:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 109. [2024-10-31 22:17:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 96 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-31 22:17:37,888 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 105 [2024-10-31 22:17:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:37,889 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-31 22:17:37,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:17:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-31 22:17:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 22:17:37,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:37,891 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:17:37,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:37,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2079739038, now seen corresponding path program 1 times [2024-10-31 22:17:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678974894] [2024-10-31 22:17:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678974894] [2024-10-31 22:17:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678974894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:17:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220567698] [2024-10-31 22:17:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:17:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:17:38,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:17:38,527 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:39,072 INFO L93 Difference]: Finished difference Result 254 states and 360 transitions. [2024-10-31 22:17:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:17:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-31 22:17:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:39,074 INFO L225 Difference]: With dead ends: 254 [2024-10-31 22:17:39,075 INFO L226 Difference]: Without dead ends: 148 [2024-10-31 22:17:39,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:17:39,076 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 169 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:39,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 542 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:17:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-31 22:17:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2024-10-31 22:17:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3805309734513274) internal successors, (156), 113 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-10-31 22:17:39,096 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 106 [2024-10-31 22:17:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-10-31 22:17:39,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-10-31 22:17:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 22:17:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:39,098 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:17:39,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1630390750, now seen corresponding path program 1 times [2024-10-31 22:17:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676927856] [2024-10-31 22:17:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:40,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676927856] [2024-10-31 22:17:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676927856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:17:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370668752] [2024-10-31 22:17:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:17:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:40,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:17:40,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:17:40,138 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:40,974 INFO L93 Difference]: Finished difference Result 435 states and 614 transitions. [2024-10-31 22:17:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:40,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-31 22:17:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:40,977 INFO L225 Difference]: With dead ends: 435 [2024-10-31 22:17:40,977 INFO L226 Difference]: Without dead ends: 312 [2024-10-31 22:17:40,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:17:40,979 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 237 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:40,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 437 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:17:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-31 22:17:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 198. [2024-10-31 22:17:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3872832369942196) internal successors, (240), 173 states have internal predecessors, (240), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 22:17:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 284 transitions. [2024-10-31 22:17:41,028 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 284 transitions. Word has length 106 [2024-10-31 22:17:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:41,029 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 284 transitions. [2024-10-31 22:17:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 284 transitions. [2024-10-31 22:17:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 22:17:41,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:41,032 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:41,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:17:41,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2077770532, now seen corresponding path program 1 times [2024-10-31 22:17:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663926813] [2024-10-31 22:17:41,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663926813] [2024-10-31 22:17:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663926813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:41,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:41,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740862318] [2024-10-31 22:17:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:41,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:41,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:41,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:41,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:41,286 INFO L87 Difference]: Start difference. First operand 198 states and 284 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:41,443 INFO L93 Difference]: Finished difference Result 319 states and 456 transitions. [2024-10-31 22:17:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-31 22:17:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:41,446 INFO L225 Difference]: With dead ends: 319 [2024-10-31 22:17:41,446 INFO L226 Difference]: Without dead ends: 195 [2024-10-31 22:17:41,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:17:41,447 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-31 22:17:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 124. [2024-10-31 22:17:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-10-31 22:17:41,466 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 106 [2024-10-31 22:17:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-10-31 22:17:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-10-31 22:17:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 22:17:41,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:41,469 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:17:41,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:41,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1159429650, now seen corresponding path program 1 times [2024-10-31 22:17:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:41,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726384635] [2024-10-31 22:17:41,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:42,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726384635] [2024-10-31 22:17:42,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726384635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:42,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:42,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:17:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742145897] [2024-10-31 22:17:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:42,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:17:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:17:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:17:42,368 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:43,311 INFO L93 Difference]: Finished difference Result 417 states and 581 transitions. [2024-10-31 22:17:43,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:17:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-31 22:17:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:43,313 INFO L225 Difference]: With dead ends: 417 [2024-10-31 22:17:43,313 INFO L226 Difference]: Without dead ends: 296 [2024-10-31 22:17:43,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:17:43,314 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 174 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:43,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 555 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:17:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-31 22:17:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 188. [2024-10-31 22:17:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.361963190184049) internal successors, (222), 163 states have internal predecessors, (222), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-31 22:17:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 266 transitions. [2024-10-31 22:17:43,342 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 266 transitions. Word has length 106 [2024-10-31 22:17:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:43,342 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 266 transitions. [2024-10-31 22:17:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 266 transitions. [2024-10-31 22:17:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-31 22:17:43,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:43,344 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:17:43,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2114469292, now seen corresponding path program 1 times [2024-10-31 22:17:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93041984] [2024-10-31 22:17:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:17:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:17:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:17:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:17:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:17:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:17:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:17:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:17:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:17:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:17:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:17:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:17:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 22:17:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:17:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93041984] [2024-10-31 22:17:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93041984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:17:43,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:17:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:17:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880999449] [2024-10-31 22:17:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:17:43,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:17:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:17:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:17:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:17:43,669 INFO L87 Difference]: Start difference. First operand 188 states and 266 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:17:43,846 INFO L93 Difference]: Finished difference Result 301 states and 425 transitions. [2024-10-31 22:17:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:17:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2024-10-31 22:17:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:17:43,849 INFO L225 Difference]: With dead ends: 301 [2024-10-31 22:17:43,849 INFO L226 Difference]: Without dead ends: 179 [2024-10-31 22:17:43,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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:17:43,853 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:17:43,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:17:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-31 22:17:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 116. [2024-10-31 22:17:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:17:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-10-31 22:17:43,885 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 106 [2024-10-31 22:17:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:17:43,886 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-10-31 22:17:43,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 22:17:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-10-31 22:17:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-31 22:17:43,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:17:43,889 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:43,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:17:43,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:17:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:17:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1327552241, now seen corresponding path program 1 times [2024-10-31 22:17:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:17:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114136796] [2024-10-31 22:17:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:17:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:17:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat