./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ --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 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:33:49,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:33:50,004 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:33:50,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:33:50,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:33:50,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:33:50,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:33:50,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:33:50,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:33:50,052 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:33:50,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:33:50,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:33:50,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:33:50,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:33:50,057 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:33:50,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:33:50,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:33:50,059 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:33:50,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:33:50,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:33:50,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:33:50,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:33:50,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:33:50,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:33:50,062 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:33:50,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:33:50,063 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:33:50,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:33:50,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:33:50,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:33:50,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:33:50,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:33:50,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:33:50,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:33:50,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:33:50,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:33:50,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:33:50,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:33:50,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:33:50,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:33:50,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:33:50,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:33:50,069 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_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/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_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ 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 -> 1cf2833edd1cdae0e001cafaa7cd8c6b44382f8b73a263b509a9183609c6c876 [2023-11-23 21:33:50,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:33:50,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:33:50,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:33:50,380 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:33:50,381 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:33:50,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2023-11-23 21:33:53,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:33:54,008 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:33:54,011 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i [2023-11-23 21:33:54,023 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/data/72a168879/b8fc98ad6de74d0f8a94720d4be494d7/FLAG59f4c985e [2023-11-23 21:33:54,037 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/data/72a168879/b8fc98ad6de74d0f8a94720d4be494d7 [2023-11-23 21:33:54,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:33:54,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:33:54,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:33:54,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:33:54,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:33:54,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167b3aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54, skipping insertion in model container [2023-11-23 21:33:54,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,087 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:33:54,244 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2023-11-23 21:33:54,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:33:54,332 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:33:54,345 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-15.i[917,930] [2023-11-23 21:33:54,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:33:54,404 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:33:54,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54 WrapperNode [2023-11-23 21:33:54,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:33:54,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:33:54,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:33:54,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:33:54,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,480 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2023-11-23 21:33:54,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:33:54,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:33:54,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:33:54,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:33:54,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,510 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,557 INFO L189 HeapSplitter]: Split 127 memory accesses to 6 slices as follows [2, 16, 51, 25, 10, 23] [2023-11-23 21:33:54,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:33:54,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:33:54,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:33:54,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:33:54,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (1/1) ... [2023-11-23 21:33:54,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:33:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:33:54,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:33:54,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f142ec6-cba5-4f6f-9427-48e0496e4812/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:33:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:33:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-23 21:33:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-23 21:33:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-23 21:33:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-23 21:33:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-23 21:33:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-23 21:33:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 21:33:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 21:33:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 21:33:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 21:33:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 21:33:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-23 21:33:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-23 21:33:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-23 21:33:54,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-23 21:33:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-23 21:33:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-23 21:33:54,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-23 21:33:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 21:33:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 21:33:54,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 21:33:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 21:33:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 21:33:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-23 21:33:54,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-23 21:33:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-23 21:33:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-23 21:33:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-23 21:33:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-23 21:33:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-23 21:33:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:33:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:33:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:33:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 21:33:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 21:33:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 21:33:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 21:33:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-23 21:33:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:33:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:33:54,968 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:33:54,971 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:33:55,698 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:33:55,792 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:33:55,793 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:33:55,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:33:55 BoogieIcfgContainer [2023-11-23 21:33:55,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:33:55,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:33:55,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:33:55,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:33:55,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:33:54" (1/3) ... [2023-11-23 21:33:55,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ed45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:33:55, skipping insertion in model container [2023-11-23 21:33:55,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:33:54" (2/3) ... [2023-11-23 21:33:55,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151ed45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:33:55, skipping insertion in model container [2023-11-23 21:33:55,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:33:55" (3/3) ... [2023-11-23 21:33:55,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-15.i [2023-11-23 21:33:55,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:33:55,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:33:55,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:33:55,973 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@305d592c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:33:55,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:33:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:33:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 21:33:56,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:56,006 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:56,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:33:56,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash -205603853, now seen corresponding path program 1 times [2023-11-23 21:33:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584820987] [2023-11-23 21:33:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:33:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:33:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:33:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:33:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:33:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:33:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:33:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:33:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:33:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:33:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:33:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:33:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:33:56,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:56,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584820987] [2023-11-23 21:33:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584820987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:56,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:33:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37102891] [2023-11-23 21:33:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:56,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:33:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:33:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:33:56,637 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:33:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:56,741 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-11-23 21:33:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:33:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-11-23 21:33:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:56,759 INFO L225 Difference]: With dead ends: 209 [2023-11-23 21:33:56,760 INFO L226 Difference]: Without dead ends: 104 [2023-11-23 21:33:56,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:33:56,773 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:56,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:33:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-23 21:33:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-23 21:33:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:33:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-11-23 21:33:56,842 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-11-23 21:33:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:56,843 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-11-23 21:33:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:33:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-11-23 21:33:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 21:33:56,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:56,849 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:56,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:33:56,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:33:56,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash 101125605, now seen corresponding path program 1 times [2023-11-23 21:33:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988307018] [2023-11-23 21:33:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:33:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:33:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:33:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:33:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:33:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:33:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:33:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:33:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:33:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:33:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:33:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:33:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:33:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988307018] [2023-11-23 21:33:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988307018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:33:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536043560] [2023-11-23 21:33:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:57,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:33:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:33:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:33:57,354 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:33:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:57,434 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2023-11-23 21:33:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:33:57,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-11-23 21:33:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:57,439 INFO L225 Difference]: With dead ends: 213 [2023-11-23 21:33:57,439 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 21:33:57,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:33:57,443 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 10 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:57,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 436 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:33:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 21:33:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-11-23 21:33:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:33:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-11-23 21:33:57,465 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-11-23 21:33:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:57,466 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-11-23 21:33:57,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:33:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-11-23 21:33:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 21:33:57,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:57,470 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:57,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:33:57,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:33:57,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 833093031, now seen corresponding path program 1 times [2023-11-23 21:33:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:57,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069086659] [2023-11-23 21:33:57,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:33:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:33:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:33:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:33:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:33:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:33:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:33:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:33:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:33:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:33:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:33:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:33:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:33:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069086659] [2023-11-23 21:33:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069086659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:57,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:33:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41479851] [2023-11-23 21:33:57,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:57,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:33:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:33:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:33:57,907 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:33:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:57,950 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-11-23 21:33:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:33:57,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-11-23 21:33:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:57,955 INFO L225 Difference]: With dead ends: 212 [2023-11-23 21:33:57,955 INFO L226 Difference]: Without dead ends: 107 [2023-11-23 21:33:57,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:33:57,959 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:57,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:33:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-23 21:33:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-23 21:33:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:33:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2023-11-23 21:33:57,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 110 [2023-11-23 21:33:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:57,978 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2023-11-23 21:33:57,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:33:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2023-11-23 21:33:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 21:33:57,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:57,982 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:57,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:33:57,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:33:57,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1161051675, now seen corresponding path program 1 times [2023-11-23 21:33:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856654604] [2023-11-23 21:33:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:33:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:33:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:33:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:33:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:33:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:33:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:33:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:33:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:33:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:33:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:33:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:33:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:33:58,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856654604] [2023-11-23 21:33:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856654604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:33:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669707386] [2023-11-23 21:33:58,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:58,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:33:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:33:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:33:58,256 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:33:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:33:58,298 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-11-23 21:33:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:33:58,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-11-23 21:33:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:33:58,302 INFO L225 Difference]: With dead ends: 237 [2023-11-23 21:33:58,302 INFO L226 Difference]: Without dead ends: 131 [2023-11-23 21:33:58,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:33:58,306 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:33:58,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:33:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-23 21:33:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 108. [2023-11-23 21:33:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 21:33:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-11-23 21:33:58,323 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 110 [2023-11-23 21:33:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:33:58,324 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-11-23 21:33:58,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:33:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-11-23 21:33:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 21:33:58,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:33:58,328 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:33:58,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:33:58,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:33:58,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:33:58,329 INFO L85 PathProgramCache]: Analyzing trace with hash -459987097, now seen corresponding path program 1 times [2023-11-23 21:33:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:33:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407171100] [2023-11-23 21:33:58,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:33:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:33:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:33:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:33:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:33:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:33:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:33:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:33:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:33:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:33:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:33:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:33:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:33:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:33:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:33:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:33:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:33:59,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407171100] [2023-11-23 21:33:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407171100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:33:59,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:33:59,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:33:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434994417] [2023-11-23 21:33:59,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:33:59,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:33:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:33:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:33:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:33:59,697 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 21:34:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:00,150 INFO L93 Difference]: Finished difference Result 322 states and 464 transitions. [2023-11-23 21:34:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:34:00,151 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), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2023-11-23 21:34:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:00,154 INFO L225 Difference]: With dead ends: 322 [2023-11-23 21:34:00,155 INFO L226 Difference]: Without dead ends: 215 [2023-11-23 21:34:00,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:34:00,158 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 439 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:00,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 766 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:34:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-23 21:34:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 191. [2023-11-23 21:34:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4047619047619047) internal successors, (236), 169 states have internal predecessors, (236), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 21:34:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2023-11-23 21:34:00,222 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 110 [2023-11-23 21:34:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:00,224 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2023-11-23 21:34:00,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 21:34:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2023-11-23 21:34:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-23 21:34:00,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:00,230 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:00,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:34:00,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:00,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -999513403, now seen corresponding path program 1 times [2023-11-23 21:34:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:00,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830129069] [2023-11-23 21:34:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830129069] [2023-11-23 21:34:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830129069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:00,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:00,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:34:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140759998] [2023-11-23 21:34:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:00,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:34:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:34:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:00,997 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:01,279 INFO L93 Difference]: Finished difference Result 613 states and 887 transitions. [2023-11-23 21:34:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:34:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-11-23 21:34:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:01,287 INFO L225 Difference]: With dead ends: 613 [2023-11-23 21:34:01,288 INFO L226 Difference]: Without dead ends: 423 [2023-11-23 21:34:01,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:34:01,297 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 242 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:01,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 718 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:34:01,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-11-23 21:34:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 373. [2023-11-23 21:34:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 328 states have (on average 1.4054878048780488) internal successors, (461), 330 states have internal predecessors, (461), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-23 21:34:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 541 transitions. [2023-11-23 21:34:01,373 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 541 transitions. Word has length 111 [2023-11-23 21:34:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:01,373 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 541 transitions. [2023-11-23 21:34:01,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 541 transitions. [2023-11-23 21:34:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-23 21:34:01,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:01,376 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:01,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:34:01,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:01,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1444705491, now seen corresponding path program 1 times [2023-11-23 21:34:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720083481] [2023-11-23 21:34:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720083481] [2023-11-23 21:34:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720083481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:01,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225276534] [2023-11-23 21:34:01,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:01,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:01,972 INFO L87 Difference]: Start difference. First operand 373 states and 541 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:02,117 INFO L93 Difference]: Finished difference Result 749 states and 1085 transitions. [2023-11-23 21:34:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-11-23 21:34:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:02,122 INFO L225 Difference]: With dead ends: 749 [2023-11-23 21:34:02,122 INFO L226 Difference]: Without dead ends: 377 [2023-11-23 21:34:02,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:02,125 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 148 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:02,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 581 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-23 21:34:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 372. [2023-11-23 21:34:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 327 states have (on average 1.4036697247706422) internal successors, (459), 329 states have internal predecessors, (459), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-23 21:34:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 539 transitions. [2023-11-23 21:34:02,176 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 539 transitions. Word has length 112 [2023-11-23 21:34:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:02,177 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 539 transitions. [2023-11-23 21:34:02,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 539 transitions. [2023-11-23 21:34:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:34:02,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:02,180 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:02,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:34:02,181 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:02,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1643999055, now seen corresponding path program 1 times [2023-11-23 21:34:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093495972] [2023-11-23 21:34:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093495972] [2023-11-23 21:34:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093495972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:34:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504649347] [2023-11-23 21:34:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:02,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:34:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:02,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:34:02,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:02,648 INFO L87 Difference]: Start difference. First operand 372 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:02,932 INFO L93 Difference]: Finished difference Result 956 states and 1382 transitions. [2023-11-23 21:34:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:34:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-23 21:34:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:02,941 INFO L225 Difference]: With dead ends: 956 [2023-11-23 21:34:02,942 INFO L226 Difference]: Without dead ends: 585 [2023-11-23 21:34:02,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:34:02,946 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 190 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:02,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 966 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-11-23 21:34:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 397. [2023-11-23 21:34:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 352 states have (on average 1.40625) internal successors, (495), 354 states have internal predecessors, (495), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-23 21:34:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 575 transitions. [2023-11-23 21:34:03,010 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 575 transitions. Word has length 113 [2023-11-23 21:34:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:03,011 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 575 transitions. [2023-11-23 21:34:03,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 575 transitions. [2023-11-23 21:34:03,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:34:03,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:03,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:03,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:34:03,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:03,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 703473728, now seen corresponding path program 1 times [2023-11-23 21:34:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325713795] [2023-11-23 21:34:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325713795] [2023-11-23 21:34:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325713795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:03,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973204744] [2023-11-23 21:34:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:03,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:03,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:03,612 INFO L87 Difference]: Start difference. First operand 397 states and 575 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:03,785 INFO L93 Difference]: Finished difference Result 1045 states and 1508 transitions. [2023-11-23 21:34:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:34:03,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-23 21:34:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:03,792 INFO L225 Difference]: With dead ends: 1045 [2023-11-23 21:34:03,793 INFO L226 Difference]: Without dead ends: 649 [2023-11-23 21:34:03,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:03,795 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 137 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:03,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 640 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2023-11-23 21:34:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 462. [2023-11-23 21:34:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 417 states have (on average 1.410071942446043) internal successors, (588), 419 states have internal predecessors, (588), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-23 21:34:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 668 transitions. [2023-11-23 21:34:03,880 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 668 transitions. Word has length 113 [2023-11-23 21:34:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:03,881 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 668 transitions. [2023-11-23 21:34:03,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 668 transitions. [2023-11-23 21:34:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:34:03,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:03,884 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:03,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:34:03,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:03,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -529810965, now seen corresponding path program 1 times [2023-11-23 21:34:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933197368] [2023-11-23 21:34:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933197368] [2023-11-23 21:34:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933197368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:04,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439410398] [2023-11-23 21:34:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:04,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:04,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:04,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:04,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:04,382 INFO L87 Difference]: Start difference. First operand 462 states and 668 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:04,542 INFO L93 Difference]: Finished difference Result 1058 states and 1523 transitions. [2023-11-23 21:34:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:04,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-23 21:34:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:04,549 INFO L225 Difference]: With dead ends: 1058 [2023-11-23 21:34:04,549 INFO L226 Difference]: Without dead ends: 597 [2023-11-23 21:34:04,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:04,552 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 68 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:04,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 625 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-11-23 21:34:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 461. [2023-11-23 21:34:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 416 states have (on average 1.40625) internal successors, (585), 418 states have internal predecessors, (585), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-23 21:34:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 665 transitions. [2023-11-23 21:34:04,616 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 665 transitions. Word has length 113 [2023-11-23 21:34:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:04,617 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 665 transitions. [2023-11-23 21:34:04,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 665 transitions. [2023-11-23 21:34:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-23 21:34:04,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:04,620 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:04,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:34:04,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:04,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2076212589, now seen corresponding path program 1 times [2023-11-23 21:34:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300477527] [2023-11-23 21:34:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:05,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:05,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300477527] [2023-11-23 21:34:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300477527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:05,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:34:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523632843] [2023-11-23 21:34:05,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:05,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:34:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:05,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:34:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:34:05,269 INFO L87 Difference]: Start difference. First operand 461 states and 665 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:05,530 INFO L93 Difference]: Finished difference Result 934 states and 1345 transitions. [2023-11-23 21:34:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:34:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-11-23 21:34:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:05,537 INFO L225 Difference]: With dead ends: 934 [2023-11-23 21:34:05,537 INFO L226 Difference]: Without dead ends: 699 [2023-11-23 21:34:05,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:34:05,539 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 240 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:05,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 676 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:34:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2023-11-23 21:34:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2023-11-23 21:34:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 600 states have (on average 1.4) internal successors, (840), 603 states have internal predecessors, (840), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-23 21:34:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 960 transitions. [2023-11-23 21:34:05,614 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 960 transitions. Word has length 113 [2023-11-23 21:34:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:05,615 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 960 transitions. [2023-11-23 21:34:05,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 960 transitions. [2023-11-23 21:34:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:34:05,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:05,618 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:05,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:34:05,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:05,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -712443638, now seen corresponding path program 1 times [2023-11-23 21:34:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544529238] [2023-11-23 21:34:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:05,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544529238] [2023-11-23 21:34:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544529238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:34:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151683021] [2023-11-23 21:34:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:06,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:34:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:06,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:34:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:34:06,519 INFO L87 Difference]: Start difference. First operand 667 states and 960 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:07,276 INFO L93 Difference]: Finished difference Result 1575 states and 2262 transitions. [2023-11-23 21:34:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 21:34:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-11-23 21:34:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:07,285 INFO L225 Difference]: With dead ends: 1575 [2023-11-23 21:34:07,285 INFO L226 Difference]: Without dead ends: 909 [2023-11-23 21:34:07,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-23 21:34:07,289 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 467 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:07,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1121 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 21:34:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2023-11-23 21:34:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 783. [2023-11-23 21:34:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 696 states have (on average 1.3936781609195403) internal successors, (970), 701 states have internal predecessors, (970), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-23 21:34:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2023-11-23 21:34:07,450 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 114 [2023-11-23 21:34:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:07,451 INFO L495 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2023-11-23 21:34:07,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2023-11-23 21:34:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:34:07,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:07,455 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:07,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:34:07,455 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:07,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1597268296, now seen corresponding path program 1 times [2023-11-23 21:34:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266237799] [2023-11-23 21:34:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266237799] [2023-11-23 21:34:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266237799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605246629] [2023-11-23 21:34:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:07,902 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:08,115 INFO L93 Difference]: Finished difference Result 1723 states and 2463 transitions. [2023-11-23 21:34:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:08,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-11-23 21:34:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:08,124 INFO L225 Difference]: With dead ends: 1723 [2023-11-23 21:34:08,124 INFO L226 Difference]: Without dead ends: 979 [2023-11-23 21:34:08,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:08,131 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 65 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:08,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 645 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2023-11-23 21:34:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 781. [2023-11-23 21:34:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 694 states have (on average 1.3876080691642652) internal successors, (963), 699 states have internal predecessors, (963), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-23 21:34:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1119 transitions. [2023-11-23 21:34:08,246 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1119 transitions. Word has length 114 [2023-11-23 21:34:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:08,247 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1119 transitions. [2023-11-23 21:34:08,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1119 transitions. [2023-11-23 21:34:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:34:08,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:08,251 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:34:08,251 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:08,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1174388115, now seen corresponding path program 1 times [2023-11-23 21:34:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505121913] [2023-11-23 21:34:08,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505121913] [2023-11-23 21:34:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505121913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:08,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035511989] [2023-11-23 21:34:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:08,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:08,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:08,729 INFO L87 Difference]: Start difference. First operand 781 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:08,935 INFO L93 Difference]: Finished difference Result 1741 states and 2482 transitions. [2023-11-23 21:34:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-11-23 21:34:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:08,945 INFO L225 Difference]: With dead ends: 1741 [2023-11-23 21:34:08,945 INFO L226 Difference]: Without dead ends: 999 [2023-11-23 21:34:08,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:08,948 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 101 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:08,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 667 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-11-23 21:34:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 781. [2023-11-23 21:34:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 694 states have (on average 1.377521613832853) internal successors, (956), 699 states have internal predecessors, (956), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-23 21:34:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1112 transitions. [2023-11-23 21:34:09,064 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1112 transitions. Word has length 114 [2023-11-23 21:34:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1112 transitions. [2023-11-23 21:34:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1112 transitions. [2023-11-23 21:34:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-23 21:34:09,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:09,068 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:09,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:34:09,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:09,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1761194129, now seen corresponding path program 1 times [2023-11-23 21:34:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853679229] [2023-11-23 21:34:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:09,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853679229] [2023-11-23 21:34:09,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853679229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:09,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:09,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:09,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487846327] [2023-11-23 21:34:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:09,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:09,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:09,607 INFO L87 Difference]: Start difference. First operand 781 states and 1112 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:09,814 INFO L93 Difference]: Finished difference Result 1477 states and 2100 transitions. [2023-11-23 21:34:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-11-23 21:34:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:09,830 INFO L225 Difference]: With dead ends: 1477 [2023-11-23 21:34:09,830 INFO L226 Difference]: Without dead ends: 1009 [2023-11-23 21:34:09,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:09,835 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 208 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:09,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 832 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-11-23 21:34:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 980. [2023-11-23 21:34:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 871 states have (on average 1.3742824339839266) internal successors, (1197), 877 states have internal predecessors, (1197), 98 states have call successors, (98), 10 states have call predecessors, (98), 10 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2023-11-23 21:34:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1393 transitions. [2023-11-23 21:34:09,954 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1393 transitions. Word has length 114 [2023-11-23 21:34:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:09,955 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1393 transitions. [2023-11-23 21:34:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1393 transitions. [2023-11-23 21:34:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-23 21:34:09,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:09,957 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:34:09,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:09,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash -134001780, now seen corresponding path program 1 times [2023-11-23 21:34:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:09,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973929802] [2023-11-23 21:34:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:10,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973929802] [2023-11-23 21:34:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973929802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:34:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624637961] [2023-11-23 21:34:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:10,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:34:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:34:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:34:10,562 INFO L87 Difference]: Start difference. First operand 980 states and 1393 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:11,130 INFO L93 Difference]: Finished difference Result 2075 states and 2938 transitions. [2023-11-23 21:34:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:34:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-11-23 21:34:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:11,139 INFO L225 Difference]: With dead ends: 2075 [2023-11-23 21:34:11,139 INFO L226 Difference]: Without dead ends: 1134 [2023-11-23 21:34:11,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:34:11,142 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 517 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:11,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 948 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:34:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2023-11-23 21:34:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 868. [2023-11-23 21:34:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 778 states have (on average 1.3714652956298201) internal successors, (1067), 782 states have internal predecessors, (1067), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 21:34:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1227 transitions. [2023-11-23 21:34:11,240 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1227 transitions. Word has length 115 [2023-11-23 21:34:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:11,240 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1227 transitions. [2023-11-23 21:34:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1227 transitions. [2023-11-23 21:34:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:11,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:11,244 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:11,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:34:11,245 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:11,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1737556389, now seen corresponding path program 1 times [2023-11-23 21:34:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455890038] [2023-11-23 21:34:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:11,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455890038] [2023-11-23 21:34:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455890038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 21:34:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751968049] [2023-11-23 21:34:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:11,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 21:34:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 21:34:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:34:11,971 INFO L87 Difference]: Start difference. First operand 868 states and 1227 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 21:34:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:12,697 INFO L93 Difference]: Finished difference Result 2286 states and 3234 transitions. [2023-11-23 21:34:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 21:34:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-11-23 21:34:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:12,707 INFO L225 Difference]: With dead ends: 2286 [2023-11-23 21:34:12,707 INFO L226 Difference]: Without dead ends: 1419 [2023-11-23 21:34:12,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2023-11-23 21:34:12,710 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 674 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:12,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1334 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:34:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2023-11-23 21:34:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 887. [2023-11-23 21:34:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 797 states have (on average 1.3651191969887078) internal successors, (1088), 801 states have internal predecessors, (1088), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 21:34:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1248 transitions. [2023-11-23 21:34:12,806 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1248 transitions. Word has length 116 [2023-11-23 21:34:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:12,807 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1248 transitions. [2023-11-23 21:34:12,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-23 21:34:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1248 transitions. [2023-11-23 21:34:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:12,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:12,811 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:12,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:34:12,811 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2134709081, now seen corresponding path program 1 times [2023-11-23 21:34:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:12,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964918625] [2023-11-23 21:34:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964918625] [2023-11-23 21:34:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964918625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977545603] [2023-11-23 21:34:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:13,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:13,052 INFO L87 Difference]: Start difference. First operand 887 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:13,189 INFO L93 Difference]: Finished difference Result 1605 states and 2255 transitions. [2023-11-23 21:34:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-23 21:34:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:13,195 INFO L225 Difference]: With dead ends: 1605 [2023-11-23 21:34:13,196 INFO L226 Difference]: Without dead ends: 719 [2023-11-23 21:34:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:13,198 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:13,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 635 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2023-11-23 21:34:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 704. [2023-11-23 21:34:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 622 states have (on average 1.360128617363344) internal successors, (846), 625 states have internal predecessors, (846), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-23 21:34:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 990 transitions. [2023-11-23 21:34:13,274 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 990 transitions. Word has length 116 [2023-11-23 21:34:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:13,274 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 990 transitions. [2023-11-23 21:34:13,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 990 transitions. [2023-11-23 21:34:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:13,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:13,278 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:13,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:34:13,278 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:13,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash 823475631, now seen corresponding path program 1 times [2023-11-23 21:34:13,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:13,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994014222] [2023-11-23 21:34:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:14,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:14,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994014222] [2023-11-23 21:34:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994014222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:14,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:14,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 21:34:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418320922] [2023-11-23 21:34:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:14,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 21:34:14,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:14,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 21:34:14,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:34:14,709 INFO L87 Difference]: Start difference. First operand 704 states and 990 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:34:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:16,405 INFO L93 Difference]: Finished difference Result 1835 states and 2579 transitions. [2023-11-23 21:34:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 21:34:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-11-23 21:34:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:16,415 INFO L225 Difference]: With dead ends: 1835 [2023-11-23 21:34:16,415 INFO L226 Difference]: Without dead ends: 1329 [2023-11-23 21:34:16,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-11-23 21:34:16,418 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 506 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:16,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1979 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-23 21:34:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2023-11-23 21:34:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1320. [2023-11-23 21:34:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1162 states have (on average 1.3580034423407918) internal successors, (1578), 1172 states have internal predecessors, (1578), 138 states have call successors, (138), 19 states have call predecessors, (138), 19 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2023-11-23 21:34:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1854 transitions. [2023-11-23 21:34:16,609 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1854 transitions. Word has length 116 [2023-11-23 21:34:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:16,610 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1854 transitions. [2023-11-23 21:34:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:34:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1854 transitions. [2023-11-23 21:34:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:16,613 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:16,613 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:16,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 21:34:16,613 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:16,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 964024241, now seen corresponding path program 1 times [2023-11-23 21:34:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249148133] [2023-11-23 21:34:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249148133] [2023-11-23 21:34:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249148133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:18,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:18,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 21:34:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451461015] [2023-11-23 21:34:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 21:34:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 21:34:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:34:18,754 INFO L87 Difference]: Start difference. First operand 1320 states and 1854 transitions. Second operand has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 21:34:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:22,587 INFO L93 Difference]: Finished difference Result 3489 states and 4867 transitions. [2023-11-23 21:34:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 21:34:22,588 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2023-11-23 21:34:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:22,602 INFO L225 Difference]: With dead ends: 3489 [2023-11-23 21:34:22,602 INFO L226 Difference]: Without dead ends: 2367 [2023-11-23 21:34:22,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 21:34:22,606 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1358 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:22,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 3077 Invalid, 1859 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [170 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-23 21:34:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2023-11-23 21:34:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1134. [2023-11-23 21:34:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 995 states have (on average 1.3547738693467337) internal successors, (1348), 1003 states have internal predecessors, (1348), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-11-23 21:34:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1588 transitions. [2023-11-23 21:34:22,773 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1588 transitions. Word has length 116 [2023-11-23 21:34:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:22,774 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1588 transitions. [2023-11-23 21:34:22,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-23 21:34:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1588 transitions. [2023-11-23 21:34:22,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:22,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:22,777 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-23 21:34:22,777 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:22,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -887658148, now seen corresponding path program 1 times [2023-11-23 21:34:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270965072] [2023-11-23 21:34:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:22,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:23,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270965072] [2023-11-23 21:34:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270965072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:23,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150607302] [2023-11-23 21:34:23,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:23,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:23,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:23,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:23,029 INFO L87 Difference]: Start difference. First operand 1134 states and 1588 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:23,294 INFO L93 Difference]: Finished difference Result 2425 states and 3392 transitions. [2023-11-23 21:34:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:34:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-23 21:34:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:23,303 INFO L225 Difference]: With dead ends: 2425 [2023-11-23 21:34:23,303 INFO L226 Difference]: Without dead ends: 1292 [2023-11-23 21:34:23,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:23,306 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 114 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:23,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 801 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-11-23 21:34:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1121. [2023-11-23 21:34:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 982 states have (on average 1.3523421588594704) internal successors, (1328), 990 states have internal predecessors, (1328), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-11-23 21:34:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1568 transitions. [2023-11-23 21:34:23,466 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1568 transitions. Word has length 116 [2023-11-23 21:34:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:23,467 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1568 transitions. [2023-11-23 21:34:23,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1568 transitions. [2023-11-23 21:34:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:23,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:23,470 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:23,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-23 21:34:23,471 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:23,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1988865928, now seen corresponding path program 1 times [2023-11-23 21:34:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424865272] [2023-11-23 21:34:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424865272] [2023-11-23 21:34:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424865272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872449510] [2023-11-23 21:34:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:23,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:23,765 INFO L87 Difference]: Start difference. First operand 1121 states and 1568 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:23,989 INFO L93 Difference]: Finished difference Result 2319 states and 3254 transitions. [2023-11-23 21:34:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:34:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-23 21:34:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:23,998 INFO L225 Difference]: With dead ends: 2319 [2023-11-23 21:34:23,999 INFO L226 Difference]: Without dead ends: 1199 [2023-11-23 21:34:24,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:24,004 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 126 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:24,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 594 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2023-11-23 21:34:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1103. [2023-11-23 21:34:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 964 states have (on average 1.349585062240664) internal successors, (1301), 972 states have internal predecessors, (1301), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 112 states have call predecessors, (120), 120 states have call successors, (120) [2023-11-23 21:34:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1541 transitions. [2023-11-23 21:34:24,165 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1541 transitions. Word has length 116 [2023-11-23 21:34:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:24,166 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1541 transitions. [2023-11-23 21:34:24,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1541 transitions. [2023-11-23 21:34:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-23 21:34:24,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:24,169 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:24,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-23 21:34:24,169 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:24,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2140330353, now seen corresponding path program 1 times [2023-11-23 21:34:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012766141] [2023-11-23 21:34:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012766141] [2023-11-23 21:34:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012766141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:24,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:24,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:34:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705693966] [2023-11-23 21:34:24,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:24,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:34:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:34:24,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:34:24,476 INFO L87 Difference]: Start difference. First operand 1103 states and 1541 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:24,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:24,640 INFO L93 Difference]: Finished difference Result 1680 states and 2345 transitions. [2023-11-23 21:34:24,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:34:24,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-11-23 21:34:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:24,646 INFO L225 Difference]: With dead ends: 1680 [2023-11-23 21:34:24,646 INFO L226 Difference]: Without dead ends: 767 [2023-11-23 21:34:24,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:34:24,649 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 64 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:24,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 616 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:34:24,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2023-11-23 21:34:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2023-11-23 21:34:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 669 states have (on average 1.3423019431988041) internal successors, (898), 673 states have internal predecessors, (898), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-11-23 21:34:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1062 transitions. [2023-11-23 21:34:24,747 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1062 transitions. Word has length 116 [2023-11-23 21:34:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1062 transitions. [2023-11-23 21:34:24,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-23 21:34:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1062 transitions. [2023-11-23 21:34:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-23 21:34:24,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:24,751 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:24,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-23 21:34:24,752 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:24,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash 234855303, now seen corresponding path program 1 times [2023-11-23 21:34:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204511264] [2023-11-23 21:34:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204511264] [2023-11-23 21:34:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204511264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:26,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:26,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 21:34:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166811797] [2023-11-23 21:34:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:26,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 21:34:26,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 21:34:26,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-23 21:34:26,092 INFO L87 Difference]: Start difference. First operand 764 states and 1062 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:34:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:34:27,892 INFO L93 Difference]: Finished difference Result 1600 states and 2224 transitions. [2023-11-23 21:34:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 21:34:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-11-23 21:34:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:34:27,899 INFO L225 Difference]: With dead ends: 1600 [2023-11-23 21:34:27,899 INFO L226 Difference]: Without dead ends: 1026 [2023-11-23 21:34:27,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-11-23 21:34:27,902 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 580 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:34:27,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1519 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-23 21:34:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-11-23 21:34:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 779. [2023-11-23 21:34:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 684 states have (on average 1.340643274853801) internal successors, (917), 688 states have internal predecessors, (917), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2023-11-23 21:34:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1081 transitions. [2023-11-23 21:34:28,012 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1081 transitions. Word has length 117 [2023-11-23 21:34:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:34:28,013 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1081 transitions. [2023-11-23 21:34:28,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-23 21:34:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1081 transitions. [2023-11-23 21:34:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-23 21:34:28,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:34:28,015 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:34:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-23 21:34:28,016 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:34:28,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:34:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash 296894917, now seen corresponding path program 1 times [2023-11-23 21:34:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:34:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173101191] [2023-11-23 21:34:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:34:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:34:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:34:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 21:34:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 21:34:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-23 21:34:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:34:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 21:34:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 21:34:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 21:34:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:34:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:34:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:34:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:34:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:34:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-23 21:34:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:34:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173101191] [2023-11-23 21:34:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173101191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:34:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:34:30,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-23 21:34:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496466255] [2023-11-23 21:34:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:34:30,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 21:34:30,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:34:30,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 21:34:30,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-23 21:34:30,003 INFO L87 Difference]: Start difference. First operand 779 states and 1081 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)